NP-completeness of minimum spanner problems
- 26 January 1994
- journal article
- research article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 48 (2), 187-194
- https://doi.org/10.1016/0166-218x(94)90073-6
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Tree SpannersSIAM Journal on Discrete Mathematics, 1995
- Spanners in graphs of bounded degreeNetworks, 1994
- Grid spannersNetworks, 1993
- On sparse spanners of weighted graphsDiscrete & Computational Geometry, 1993
- Easy problems for tree-decomposable graphsJournal of Algorithms, 1991
- Delaunay graphs are almost as good as complete graphsDiscrete & Computational Geometry, 1990
- Graph spannersJournal of Graph Theory, 1989
- An optimal synchronizer for the hypercubePublished by Association for Computing Machinery (ACM) ,1987
- Reconstructing the shape of a tree from observed dissimilarity dataAdvances in Applied Mathematics, 1986
- There is a planar graph almost as good as the complete graphPublished by Association for Computing Machinery (ACM) ,1986