I/O-Efficiently Pruning Dense Spanners

DOI10.1007/11589440_11zbMath1136.68460OpenAlexW1537423327MaRDI QIDQ5449759

Joachim Gudmundsson, Jan Vahrenhold

Publication date: 18 March 2008

Published in: Discrete and Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11589440_11

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (1)

Pruning spanners and constructing well-separated pair decompositions in the presence of memory hierarchies

This page was built for publication: I/O-Efficiently Pruning Dense Spanners