On the Spanning and Routing Ratio of Theta-Four
Abstract

Formats available
You can view the full content in the following formats:
Information & Authors
Information
Published In

Copyright
History
Authors
Metrics & Citations
Metrics
Citations
If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.
Cited By
- Routing on heavy path WSPD spannersComputational Geometry, Vol. 123 | 1 Dec 2024
- Emanation Graph: A Plane Geometric Spanner with Steiner PointsGraphs and Combinatorics, Vol. 39, No. 2 | 31 March 2023
- Generalized Sweeping Line SpannersComputing and Combinatorics | 1 January 2023
- On the Spanning and Routing Ratios of the Directed $$\varTheta _6$$-GraphAlgorithms and Data Structures | 31 July 2021
- Improved Bounds on the Spanning Ratio of the Theta-5-GraphAlgorithms and Data Structures | 31 July 2021
- Spanning Properties of Theta–Theta-6Graphs and Combinatorics, Vol. 36, No. 3 | 10 February 2020
- Truly Optimal Euclidean Spanners2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS) | 1 Nov 2019
- Maximum Matchings and Minimum Blocking Sets in $$\varTheta _6$$ -GraphsGraph-Theoretic Concepts in Computer Science | 12 September 2019
View Options
View options
- Access via your Institution
- Questions about how to access this content? Contact SIAM at [email protected].