Generating sparse spanners for weighted graphs
- 1 January 1990
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Graph spannersJournal of Graph Theory, 1989
- Compact distributed data structures for adaptive routingPublished by Association for Computing Machinery (ACM) ,1989
- There are planar graphs almost as good as the complete graphs and as short as minimum spanning treesPublished by Springer Nature ,1989
- Which triangulations approximate the complete graph?Published by Springer Nature ,1989
- On optimal realizations of finite metric spaces by graphsDiscrete & Computational Geometry, 1988
- A tradeoff between space and efficiency for routing tablesPublished by Association for Computing Machinery (ACM) ,1988
- Sphere Packings, Lattices and GroupsPublished by Springer Nature ,1988
- Reconstructing the shape of a tree from observed dissimilarity dataAdvances in Applied Mathematics, 1986
- 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