There are planar graphs almost as good as the complete graphs and as short as minimum spanning trees
Authors:
- 1 January 1989
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 9-13
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- The Delaunay triangulation closely approximates the complete Euclidean graph1989
- Approximating the complete Euclidean graph1988
- Delaunay graphs are almost as good as complete graphs1987
- There is a planar graph almost as good as the complete graph1986
- A note on Delaunay and optimal triangulationsInformation Processing Letters, 1980
- Finding Minimum Spanning TreesSIAM Journal on Computing, 1976