On the Stretch Factor of the Theta-4 Graph
From MaRDI portal
Publication:2842149
DOI10.1007/978-3-642-40104-6_10zbMath1269.68105arXiv1303.5473OpenAlexW1561982800WikidataQ29031099 ScholiaQ29031099MaRDI QIDQ2842149
Sander Verdonschot, Prosenjit Bose, André van Renssen, Jean-Lou De Carufel, Luis Barba
Publication date: 12 August 2013
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1303.5473
Applications of graph theory (05C90) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (17)
On the spanning and routing ratios of the directed \(\varTheta_6\)-graph ⋮ Improved bounds on the spanning ratio of the theta-5-graph ⋮ On the spanning and routing ratios of the directed \(\Theta_6\)-graph ⋮ Routing in polygonal domains ⋮ Theta-3 is connected ⋮ Generalized sweeping line spanners ⋮ On the spanning and routing ratio of the directed theta-four graph ⋮ Generalized sweeping line spanners ⋮ Cone-based spanners of constant degree ⋮ Towards tight bounds on theta-graphs: more is not always better ⋮ 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 ⋮ The Price of Order ⋮ 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 Stretch Factor of the Theta-4 Graph
