Article thumbnail

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

By Gerth Stølting Brodal, Rolf Fagerberg, Ulrich Meyer and Norbert Zeh

Abstract

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 close the performance gap between the currently best cache-aware 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

Publisher: Springer
Year: 2004
OAI identifier: oai:CiteSeerX.psu:10.1.1.120.9134
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://users.cs.dal.ca/~nzeh/P... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.