Yao graphs span theta graphs

DOI10.1142/S1793830912500243MaRDI QIDQ3166731zbMATH OpenFDO

Authors Mirela Damian, Kristin Raudonis

Publication date 15 October 2012

Published in Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S1793830912500243

zbMATH Keywords

spannertheta graphYao graph

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Yao Graphs Span Theta Graphs
• Spanning properties of theta-theta graphs
• New and improved spanning ratios for Yao graphs
• New and improved spanning ratios for Yao graphs
• An infinite class of Sparse-Yao spanners

Cites work

• Approximating geometric bottleneck shortest paths
• Distributed Computing: A Locality-Sensitive Approach
• Geometric Spanner Networks
• There are planar graphs almost as good as the complete graph

Cited in

(15)

• Continuous Yao graphs
• Routing in polygonal domains
• The \(\varTheta_5\)-graph is a spanner
• Improved bounds on the stretch factor of \(Y_{4}\)
• Fault tolerancy of continuous Yao graph of angle less than 2/5
• Emanation graph: a plane geometric spanner with Steiner points
• Spanning properties of theta-theta graphs
• New and improved spanning ratios for Yao graphs
• Connections between Theta-graphs, Delaunay triangulations, and orthogonal surfaces
• Yao Graphs Span Theta Graphs
• Almost All Even Yao-Yao Graphs Are Spanners
• New and improved spanning ratios for Yao graphs
• Spanning properties of Yao and -graphs in the presence of constraints
• An infinite class of Sparse-Yao spanners
• Routing among convex polygonal obstacles in the plane

This page was built for publication: Yao graphs span theta graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3166731)