On the spanning and routing ratios of the directed \(\varTheta_6\)-graph

DOI10.1007/978-3-030-83508-8_1OpenAlexW3188087441MaRDI QIDQ832828

Ahmad Biniaz, Prosenjit Bose, Hugo A. Akitaya

Publication date: 25 March 2022

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

zbMATH Keywords

routing algorithmsspannerstheta graphs

Mathematics Subject Classification ID

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

Uses Software

• Algorithm 447

Cites Work

• Unnamed Item
• A note on two problems in connexion with graphs
• Theta-3 is connected
• Towards tight bounds on theta-graphs: more is not always better
• Classes of graphs which approximate the complete Euclidean graph
• There are planar graphs almost as good as the complete graph
• On the Stretch Factor of the Theta-4 Graph
• Gabriel Triangulations and Angle-Monotone Graphs: Local Routing and Recognition
• Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces
• Geometric Spanner Networks
• Optimal Local Routing on Delaunay Triangulations Defined by Empty Equilateral Triangles
• Probability on Graphs
• Online Routing in Triangulations
• Expected Complexity of Routing in $\Theta_6$ and Half-$\Theta_6$ Graphs
• On the Spanning and Routing Ratio of Theta-Four