Local routing on ordered Θ-graphs
Open Access
- 12 August 2026
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 1085
Abstract
No abstract availableAll Related Versions
Funding Information
- Government of Western Australia
- Australian Research Council (DP240101353)
This publication has 7 references indexed in Scilit:
- On the Spanning and Routing Ratio of the Directed Theta-Four GraphDiscrete & Computational Geometry, 2023
- The Price of OrderInternational Journal of Computational Geometry & Applications, 2016
- Towards tight bounds on theta-graphs: More is not always betterTheoretical Computer Science, 2016
- Optimal Local Routing on Delaunay Triangulations Defined by Empty Equilateral TrianglesSIAM Journal on Computing, 2015
- On plane geometric spanners: A survey and open problemsComputational Geometry, 2013
- Ordered theta graphsComputational Geometry, 2004
- A note on two problems in connexion with graphsNumerische Mathematik, 1959