Item Details

Print View

Degree-Constrained Pyramid Spanners

Richards, Dana; Liestman, Arthur
Format
Report
Author
Richards, Dana
Liestman, Arthur
Abstract
A t-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 I edges. We give several results that present trade-offs between t and the maximum degree of a t - spanner. Note: Abstract extracted from PDF file via OCR
Language
English
Date Received
2012-10-29
Published
University of Virginia, Department of Computer Science, 1991
Published Date
1991
Rights
All rights reserved (no additional license for public reuse)
Collection
Libra Open Repository

Availability

Access Online