There is a planar graph almost as good as the complete graph
SCG '86 Proceedings of the second annual symposium on Computational geometry
There are planar graphs almost as good as the complete graph
Journal of Computer and System Sciences
Delaunay graphs are almost as good as complete graphs
Discrete & Computational Geometry
The K-Gabriel graphs and their applications
SIGAL '90 Proceedings of the international symposium on Algorithms
Which triangulations approximate the complete graph?
Proceedings of the international symposium on Optimal algorithms
Computational Geometry: Theory and Applications
Computing a subgraph of the minimum weight triangulation
Computational Geometry: Theory and Applications
A better subgraph of the minimum weight triangulation
Information Processing Letters
Approaching the largest &bgr;-skeleton within a minimum weight triangulation
Proceedings of the twelfth annual symposium on Computational geometry
The crust and the &Bgr;-Skeleton: combinatorial curve reconstruction
Graphical Models and Image Processing
The Delauney Triangulation Closely Approximates the Complete Euclidean Graph
WADS '89 Proceedings of the Workshop on Algorithms and Data Structures
Geometric spanners with applications in wireless networks
Computational Geometry: Theory and Applications
On a locally minimum cost forwarding game
Proceedings of the 2nd ACM international workshop on Foundations of wireless ad hoc and sensor networking and computing
Fault-tolerant spanners for ad hoc networks
International Journal of Network Management
New sequential and parallel algorithms for computing the β-spectrum
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
| Hi-index | 0.00 |
A fractal construction shows that, for any β 0, the β-skeleton of a point set can have arbitrarily large dilation. In particular this applies to the Gabriel graph.