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.

• Type: Conference
• Year: 2004
• Where: SWAT
• Authors: Gerth Stølting Brodal, Rolf Fagerberg, Ulrich Meyer, Norbert Zeh
• Keywords: Algorithms, Data Structure, Non-negative Edge Weights, Single-source Shortest Path Problem, SWAT 2004