Spanners in graphs of bounded degree
- 1 July 1994
- Vol. 24 (4), 233-249
- https://doi.org/10.1002/net.3230240406
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Additive graph spannersNetworks, 1993
- Grid spannersNetworks, 1993
- On sparse spanners of weighted graphsDiscrete & Computational Geometry, 1993
- Classes of graphs which approximate the complete euclidean graphDiscrete & Computational Geometry, 1992
- A sparse graph almost as good as the complete graph on points inK dimensionsDiscrete & Computational Geometry, 1991
- Delaunay graphs are almost as good as complete graphsDiscrete & Computational Geometry, 1990
- Graph spannersJournal of Graph Theory, 1989
- Reconstructing the shape of a tree from observed dissimilarity dataAdvances in Applied Mathematics, 1986
- Complexity of network synchronizationJournal of the ACM, 1985
- The NP-completeness column: An ongoing guideJournal of Algorithms, 1982