Cache-oblivious planar shortest paths

Authors:
Hema Jampala;Norbert Zeh
Affiliations:
Faculty of Computer Science, Dalhousie University, Halifax, NS, Canada;Faculty of Computer Science, Dalhousie University, Halifax, NS, Canada
Venue:
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Year:
2005

Citing 19
Cited 3

Fast algorithms for shortest paths in planar graphs, with applications

SIAM Journal on Computing
The input/output complexity of sorting and related problems

Communications of the ACM
Faster shortest-path algorithms for planar graphs

Journal of Computer and System Sciences - Special issue: 26th annual ACM symposium on the theory of computing & STOC'94, May 23–25, 1994, and second annual Europe an conference on computational learning theory (EuroCOLT'95), March 13–15, 1995
External-memory graph algorithms

Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Undirected single-source shortest paths with positive integer weights in linear time

Journal of the ACM (JACM)
Floats, integers, and single source shortest paths

Journal of Algorithms
Cache-oblivious priority queue and graph algorithm applications

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Computing shortest paths with comparisons and additions

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
I/O-optimal algorithms for planar graphs using separators

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
On External-Memory Planar Depth First Search

WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Cache Oblivious Distribution Sweeping

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Funnel Heap - A Cache Oblivious Priority Queue

ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
I/O-efficient topological sorting of planar DAGs

Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
On the limits of cache-obliviousness

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Cache-Oblivious Algorithms

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Planar Graphs, Negative Weight Edges, Shortest Paths, and Near Linear Time

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
I/O-Efficient Strong Connectivity and Depth-First Search for Directed Planar Graphs

FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Cache-oblivious shortest paths in graphs using buffer heap

Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
On external-memory MST, SSSP and multi-way planar graph separation

Journal of Algorithms

Engineering a cache-oblivious sorting algorithm

Journal of Experimental Algorithmics (JEA)
A faster cache-oblivious shortest-path algorithm for undirected graphs with bounded edge lengths

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Terracost: Computing least-cost-path surfaces for massive grid terrains

Journal of Experimental Algorithmics (JEA)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an efficient cache-oblivious implementation of the shortest-path algorithm for planar graphs by Klein et al., and prove that it incurs no more than ${\mathcal O}(\frac{N}{B^{1/2 - \epsilon}} + \frac{N}{B}{\rm log}N$) block transfers on a graph with N vertices. This is the first cache-oblivious algorithm for this problem that incurs o(N) block transfers.