Improved bounds on the spanning ratio of the theta-5-graph

DOI10.1007/978-3-030-83508-8_16MaRDI QIDQ832862zbMATH OpenOpenAlexFDO

Authors Prosenjit Bose, Darryl Hill, Aurélien Ooms

Publication date 25 March 2022

Full work available at URL https://doi.org/10.1007/978-3-030-83508-8_16

zbMATH Keywords

theta graphsgeometric spannersstretch factorspanning ratio

Mathematics Subject Classification ID

Data structures (68P05) Algorithms in computer science (68Wxx)

Cites work

• scientific article; zbMATH DE number 4070353 (Why is no real title available?)
• Classes of graphs which approximate the complete Euclidean graph
• On the spanning and routing ratio of Theta-Four
• On the stretch factor of the theta-4 graph
• The \(\varTheta_5\)-graph is a spanner
• There are planar graphs almost as good as the complete graph
• Theta-3 is connected
• Towards tight bounds on theta-graphs: more is not always better

Cited in

(6)

• On the spanning and routing ratios of the directed \(\Theta_6\)-graph
• Minimum weight Euclidean \((1+\varepsilon)\)-spanners
• Generalized sweeping line spanners
• Emanation graph: a plane geometric spanner with Steiner points
• Generalized sweeping line spanners
• On the spanning and routing ratio of the directed theta-four graph

This page was built for publication: Improved bounds on the spanning ratio of the theta-5-graph

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