Publication: Degree-Constrained Pyramid Spanners
Loading...
Files
Date
Journal Title
Journal ISSN
Volume Title
Publisher
University of Virginia, Department of Computer Science
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
Description
Original submission date: 2013-10-17T20:30:58Z
Subjects
Citation
Richards, Dana, and Arthur Liestman. "Degree-Constrained Pyramid Spanners." University of Virginia Dept. of Computer Science Tech Report (1990).