Publication:
Degree-Constrained Pyramid Spanners

Simple item page
dc.contributor.authorLiestman, Arthur
dc.contributor.authorRichards, Dana
dc.date.accessioned2026-01-22T17:22:04Z
dc.date.issued1990-01-01
dc.descriptionOriginal submission date: 2013-10-17T20:30:58Z
dc.description.abstractA I-spanner of a pyramid network is a subnetwork in which every two nodes that were connected by an edge in the original pyramid can be connected by a path in the subnetwork with at most 2 edges. We give several results that present trade~offs between t and the maximum degree of a t - spannerr Note: Abstract extracted from PDF file via OCR
dc.identifier9g54xh691
dc.identifier.citationRichards, Dana, and Arthur Liestman. "Degree-Constrained Pyramid Spanners." University of Virginia Dept. of Computer Science Tech Report (1990).
dc.identifier.doi10.18130/V3Z79T
dc.identifier.urihttps://doi.org/10.18130/V3Z79T
dc.identifier.urihttps://libraopen.library.virginia.edu/handle/item/7707
dc.languageEnglish
dc.language.isoen
dc.publisherUniversity of Virginia, Department of Computer Science
dc.rightsAll rights reserved (no additional license for public reuse)
dc.titleDegree-Constrained Pyramid Spanners
dc.typeTechnical Report
dspace.entity.typePublication
relation.isAuthorOfPublication68e4276c-2448-42d8-b96d-5d03cacfd4f8
relation.isAuthorOfPublicationfa31f97a-0f3d-42a6-a52b-d5744b568aba
relation.isAuthorOfPublication.latestForDiscovery68e4276c-2448-42d8-b96d-5d03cacfd4f8

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR-90-16.pdf
Size:
566.19 KB
Format:
Adobe Portable Document Format
Download

Collections

Computer Science