Classes of graphs which approximate the complete euclidean graph

Computational Geometry--An Introduction.

Mikhail J. Atallah, Franco P. Preparata, Michael Ian Shamos · Mathematics of Computation · 1986 · 4.3K citations

Geometric Modeling, Discrete Geometry, Engineering +11

On Constructing Minimum Spanning Trees in <i>k</i>-Dimensional Spaces and Related Problems

Andrew Chi-Chih Yao · SIAM Journal on Computing · 1982 · 607 citations

Geometric Graph Theory, Engineering, Graph Theory +14

Graph spanners

David Peleg, Alejandro A. Schäffer · Journal of Graph Theory · 1989 · 417 citations

Graph Sparsity, Network Science, Graph Theory +10

There are planar graphs almost as good as the complete graph

L. Paul Chew · Journal of Computer and System Sciences · 1989 · 270 citations

Geometric Graph Theory, Network Science, Graph Theory +11

There is a planar graph almost as good as the complete graph

Paul Chew · 1986 · 235 citations

Engineering, Geometry, Pathfinding +27