In this paper we show that the θ-graph with 4 cones has constant stretch factor, i.e., there is a path between any pair of vertices in this graph whose length is at most a constant times the Euclidean distance between that pair of vertices. This is the last θ-graph for which it was not known whether its stretch factor was bounded. © 2013 Springer-Verlag.
CITATION STYLE
Barba, L., Bose, P., De Carufel, J. L., Van Renssen, A., & Verdonschot, S. (2013). On the stretch factor of the theta-4 graph. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8037 LNCS, pp. 109–120). https://doi.org/10.1007/978-3-642-40104-6_10
Mendeley helps you to discover research relevant for your work.