Classes of graphs which approximate the complete Euclidean graph
Discrete & Computational Geometry
On sparse spanners of weighted graphs
Discrete & Computational Geometry
Optimally sparse spanners in 3-dimensional Euclidean space
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
A fast algorithm for constructing sparse Euclidean spanners
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
A new way to weigh Malnourished Euclidean graphs
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Routing with guaranteed delivery in ad hoc wireless networks
Wireless Networks
Fast Greedy Algorithms for Constructing Sparse Geometric Spanners
SIAM Journal on Computing
Distributed Spanner with Bounded Degree for Wireless Ad Hoc Networks
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Localized construction of bounded degree and planar spanner for wireless ad hoc networks
Mobile Networks and Applications
Geometric Spanner Networks
On Spanners and Lightweight Spanners of Geometric Graphs
SIAM Journal on Computing
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
Localized Delaunay triangulation with application in ad hoc wireless networks
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 0.00 |
We show that, for any constant $$\rho 1$$, there exists an integer constant $$k$$ such that the Yao---Yao graph with parameter $$k$$ defined on a civilized unit disk graph is a geometric spanner of stretch factor $$\rho $$. This improves the results of Wang and Li in several aspects, as described in the paper. This partially answers an open problem posed by Demaine, Mitchell and O'Rourke about the spanner properties of Yao---Yao graphs. We also show that the Yao---Yao graph with parameter $$k=4$$ defined on the complete Euclidean graph is not plane.