On sparse spanners of weighted graphs
- 1 January 1993
- journal article
- research article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 9 (1) , 81-100
- https://doi.org/10.1007/bf02189308
Abstract
No abstract availableThis publication has 18 references indexed in Scilit:
- An Optimal Synchronizer for the HypercubeSIAM Journal on Computing, 1989
- Graph spannersJournal of Graph Theory, 1989
- Ramanujan graphsCombinatorica, 1988
- On optimal realizations of finite metric spaces by graphsDiscrete & Computational Geometry, 1988
- Shortest paths in euclidean graphsAlgorithmica, 1986
- Reconstructing the shape of a tree from observed dissimilarity dataAdvances in Applied Mathematics, 1986
- Complexity of network synchronizationJournal of the ACM, 1985
- Trees, tight extensions of metric spaces, and the cohomological dimension of certain groups: A note on combinatorial properties of metric spacesAdvances in Mathematics, 1984
- Regular d-valent graphs of girth 6 and 2(d2−d+1) verticesJournal of Combinatorial Theory, 1970
- A note on the tree realizability of a distance matrixJournal of Combinatorial Theory, 1969