Item Details

Print View

Degree-Constrained Pyramid Spanners

Richards, Dana; Liestman, Arthur
Format
Report
Author
Richards, Dana
Liestman, Arthur
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
Language
English
Date Received
2012-10-29
Published
University of Virginia, Department of Computer Science, 1990
Published Date
1990
Collection
Libra Open Repository
In CopyrightIn Copyright
▾See more
▴See less

Availability

Access Online