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

Forfattere

  • Gerth Stølting Brodal
  • Rolf Fagerberg
  • Ulrich Meyer
  • Norbert Zeh

DOI:

https://doi.org/10.7146/brics.v11i2.21827

Resumé

We present improved cache-oblivious data structures and algorithms for breadth-first search (BFS) on undirected graphs and the single-source shortest path (SSSP) problem on undirected graphs with non-negative edge weights. For the SSSP problem, our result closes the performance gap between the currently best cache-aware algorithm and the cache-oblivious counterpart. Our cache-oblivious SSSP-algorithm takes nearly full advantage of block transfers for dense graphs. The 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. For the BFS problem, we reduce the number of I/Os for sparse graphs by a factor of nearly sqrt{B}, where B is the cache-block size, nearly closing the performance gap between the currently best cache-aware and cache-oblivious algorithms.

Downloads

Publiceret

2004-02-11

Citation/Eksport

Brodal, G. S., Fagerberg, R., Meyer, U., & Zeh, N. (2004). Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths. BRICS Report Series, 11(2). https://doi.org/10.7146/brics.v11i2.21827

Nummer

Nr. 2 (2004): RS-2 Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths

Sektion

Artikler

Licens

Authors who publish with this journal agree to the following terms:

    1. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.

    1. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.

  1. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).