On the spanning and routing ratios of the directed _6-graph

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

Authors: Hugo A. Akitaya, Ahmad Biniaz, Prosenjit Bose 

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

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

Cites Work

• A note on two problems in connexion with graphs
• Geometric Spanner Networks
• There are planar graphs almost as good as the complete graph
• Classes of graphs which approximate the complete Euclidean graph
• Connections between Theta-graphs, Delaunay triangulations, and orthogonal surfaces
• On the stretch factor of the theta-4 graph
• Theta-3 is connected
• Title not available (Why is that?)
• Online Routing in Triangulations
• Probability on graphs. Random processes on graphs and lattices.
• Gabriel triangulations and angle-monotone graphs: local routing and recognition
• Optimal local routing on Delaunay triangulations defined by empty equilateral triangles
• Expected complexity of routing in \(\Theta_6\) and half-\(\Theta_6\) graphs
• On the spanning and routing ratio of Theta-Four
• Towards tight bounds on theta-graphs: more is not always better

Cited In (2)

• On the spanning and routing ratios of the directed \(\Theta_6\)-graph
• Spanning properties of Theta-Theta-6

Uses Software

• Algorithm 447

This page was built for publication: On the spanning and routing ratios of the directed \(\varTheta_6\)-graph

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