Degree-Constrained Pyramid Spanners
ReportAuthors:Richards, Dana, Department of Computer ScienceUniversity of Virginia Liestman, Arthur, Department of Computer ScienceUniversity of Virginia
Abstract:
A 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
Rights:
All rights reserved (no additional license for public reuse)
All rights reserved (no additional license for public reuse)
Language:
English
English
Source Citation:
Richards, Dana, and Arthur Liestman. "Degree-Constrained Pyramid Spanners." University of Virginia Dept. of Computer Science Tech Report (1990).
Publisher:
University of Virginia, Department of Computer Science
University of Virginia, Department of Computer Science
Published Date:
1990
1990
