Graph spanners
- 1 March 1989
- journal article
- research article
- Published by Wiley in Journal of Graph Theory
- Vol. 13 (1), 99-116
- https://doi.org/10.1002/jgt.3190130114
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- A tradeoff between space and efficiency for routing tablesPublished by Association for Computing Machinery (ACM) ,1988
- Delaunay graphs are almost as good as complete graphsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1987
- An optimal synchronizer for the hypercubePublished by Association for Computing Machinery (ACM) ,1987
- Optimal simulations of tree machinesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986
- There is a planar graph almost as good as the complete graphPublished by Association for Computing Machinery (ACM) ,1986
- Complexity of network synchronizationJournal of the ACM, 1985
- Computational GeometryPublished by Springer Nature ,1985
- A Separator Theorem for Chordal GraphsSIAM Journal on Algebraic Discrete Methods, 1984
- A characterisation of rigid circuit graphsDiscrete Mathematics, 1974
- The intersection graphs of subtrees in trees are exactly the chordal graphsJournal of Combinatorial Theory, Series B, 1974