YAO GRAPHS SPAN THETA GRAPHS

DOI10.1142/S1793830912500243zbMath1251.05166MaRDI QIDQ3166731

Mirela Damian, Kristin Raudonis

Publication date: 15 October 2012

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

zbMATH Keywords

spannertheta graphYao graph

Mathematics Subject Classification ID

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

Related Items (5)

Routing in polygonal domains ⋮ Continuous Yao graphs ⋮ Emanation graph: a plane geometric spanner with Steiner points ⋮ The \(\varTheta_5\)-graph is a spanner ⋮ Spanning Properties of Yao and 𝜃-Graphs in the Presence of Constraints

Cites Work

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

This page was built for publication: YAO GRAPHS SPAN THETA GRAPHS