Sciweavers

SWAT
2004
Springer

Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths

14 years 4 months ago
Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths
We present improved cache-oblivious data structures and algorithms for breadth-first search and the single-source shortest path problem on undirected graphs with non-negative edge weights. Our results removes the performance gap between the currently best cacheaware algorithms for these problems and their cache-oblivious counterparts. Our shortest-path algorithm relies on a new data structure, called bucket heap, which is the first cache-oblivious priority queue to efficiently support a weak DecreaseKey operation.
Gerth Stølting Brodal, Rolf Fagerberg, Ulri
Added 02 Jul 2010
Updated 02 Jul 2010
Type Conference
Year 2004
Where SWAT
Authors Gerth Stølting Brodal, Rolf Fagerberg, Ulrich Meyer, Norbert Zeh
Comments (0)