Abstract
The construction of t-spanners of a given point set has received a lot of attention, especially from a theoretical perspective. We experimentally study the performance of the most common construction algorithms for points in the Euclidean plane. In a previous paper [10] we considered the properties of the produced graphs from five common algorithms. We consider several additional algorithms and focus on the running times. This is the first time an extensive comparison has been made between the running times of construction algorithms of t-spanners. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Farshi, M., & Gudmundsson, J. (2007). Experimental study of geometric t-spanners: A running time comparison. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4525 LNCS, pp. 270–284). Springer Verlag. https://doi.org/10.1007/978-3-540-72845-0_21
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
