On the Spanning Ratio of Theta-Graphs

DOI10.1007/978-3-642-40104-6_16zbMath1390.68712OpenAlexW165089886MaRDI QIDQ2842156

Prosenjit Bose, Sander Verdonschot, André van Renssen

Publication date: 12 August 2013

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-40104-6_16

zbMATH Keywords

computational geometryspannersspanning ratio\(\theta \)-graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (9)

Optimal Local Routing on Delaunay Triangulations Defined by Empty Equilateral Triangles ⋮ Theta-3 is connected ⋮ Cone-based spanners of constant degree ⋮ Towards tight bounds on theta-graphs: more is not always better ⋮ The \(\varTheta_5\)-graph is a spanner ⋮ The Stretch - Length Tradeoff in Geometric Networks: Average Case and Worst Case Study ⋮ The Price of Order ⋮ Odd Yao-Yao Graphs are Not Spanners ⋮ Reprint of: Theta-3 is connected

This page was built for publication: On the Spanning Ratio of Theta-Graphs