Classes of graphs which approximate the complete Euclidean graph
Discrete & Computational Geometry
Distributed computing: a locality-sensitive approach
Distributed computing: a locality-sensitive approach
Routing with guaranteed delivery in ad hoc wireless networks
Wireless Networks
Fast Greedy Algorithms for Constructing Sparse Geometric Spanners
SIAM Journal on Computing
Constructing Plane Spanners of Bounded Degree and Low Weight
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Localized construction of bounded degree and planar spanner for wireless ad hoc networks
Mobile Networks and Applications
Geometric Spanner Networks
Computational Geometry: Algorithms and Applications
Computational Geometry: Algorithms and Applications
Local Construction of Near-Optimal Power Spanners for Wireless Ad Hoc Networks
IEEE Transactions on Mobile Computing
Plane spanners of maximum degree six
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
On Spanners and Lightweight Spanners of Geometric Graphs
SIAM Journal on Computing
Separability and topology control of quasi unit disk graphs
Wireless Networks
Geometric spanners for routing in mobile networks
IEEE Journal on Selected Areas in Communications
| Hi-index | 5.23 |
Let S be a set of n points in the plane, let E be the complete Euclidean graph whose point set is S, and let G be the Delaunay triangulation of S. We present a very simple local algorithm that, given G, constructs a subgraph of G of degree at most 11 that is a geometric spanner of G with stretch factor 2.86, and hence a geometric spanner of E with stretch factor