Skip to main content
Article thumbnail
Location of Repository

A faster cache-oblivious shortest-path algorithm for undirected graphs with bounded edge lengths

By Luca Allulli, Peter Lichodzijewski and Norbert Zeh

Abstract

We present a cache-oblivious algorithm for computing single-source shortest paths in undirected graphs with non-negative edge lengths. The algorithm incurs O ( √ (nm log W)/B +(m/B)logn+MST(n, m) ) memory transfers on a graph with n vertices, m edges, and real edge lengths between 1 and W; B denotes the cache block size, and MST(n, m) denotes the number of memory transfers required to compute a minimum spanning tree of a graph with n vertices and m edges. Our algorithm is the first cache-oblivious shortest-path algorithm incurring less than one memory transfer per vertex if the graph is sparse (m =O(n)) and W =2o(B).

Year: 2013
OAI identifier: oai:CiteSeerX.psu:10.1.1.307.5871
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://web.cs.dal.ca/~nzeh/Pub... (external link)
  • Suggested articles


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