Pruning Spanners and Constructing Well-Separated Pair Decompositions in the Presence of Memory Hierarchies

Gieseke, Fabian; Gudmundsson, Joachim; Vahrenhold, Jan

Keywords

Cache-Oblivious Algorithms; Spanner Graphs

Cite as

Gieseke, F., Gudmundsson, J., & Vahrenhold, J. (2010). Pruning Spanners and Constructing Well-Separated Pair Decompositions in the Presence of Memory Hierarchies. Journal of Discrete Algorithms, 8(2), 259–272.

Details

Publication type
Research article (journal)

Peer reviewed
Yes

Publication status
Published

Year
2010

Journal
Journal of Discrete Algorithms

Volume
8

Issue
2

Start page
259

End page
272

Language
English

ISSN
1570-8667

DOI
https://doi.org/10.1016/j.jda.2010.03.001