Classes of graphs which approximate the complete euclidean graph
Authors:
Open Access
- 1 January 1992
- journal article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 7 (1) , 13-28
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- There are planar graphs almost as good as the complete graphJournal of Computer and System Sciences, 1989
- Graph spannersJournal of Graph Theory, 1989
- Delaunay graphs are almost as good as complete graphs1987
- Shortest paths in euclidean graphsAlgorithmica, 1986
- There is a planar graph almost as good as the complete graph1986
- Computational Geometry1985
- On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related ProblemsSIAM Journal on Computing, 1982