On Spanners of Geometric Graphs

DOI10.1007/11785293_36zbMath1142.05346OpenAlexW1496182974MaRDI QIDQ5757901

Joachim Gudmundsson, Michiel H. M. Smid

Publication date: 7 September 2007

Published in: Algorithm Theory – SWAT 2006 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11785293_36

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (1)

Spanners of Complete k-Partite Geometric Graphs

This page was built for publication: On Spanners of Geometric Graphs