I/O-Efficient Strong Connectivity and Depth-First Search for Directed Planar Graphs

Authors:
Lars Arge;Norbert Zeh
Affiliations:
-;-
Venue:
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Year:
2003

Citing 0
Cited 4

Algorithms and data structures for external memory

Foundations and Trends® in Theoretical Computer Science
Cache-oblivious planar shortest paths

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
External data structures for shortest path queries on planar digraphs

ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
I/O-Efficient algorithms on near-planar graphs

LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present the first I/O-efficient algorithms for the following fundamental problems on directed planar graphs: finding the strongly connected components, finding a simple-path 23-separator, and computing a depth-first spanning (DFS) tree. Our algorithms for the first two problems perform O(sort(N)) I/Os, where N = V + E and sort(N) = THgr;((N/B)log M/B(N/B)) is the number of I/Os required to sort N elements. The DFS-algorithm performs O(sort(N) log(N/M)) I/Os, where M is the number of elements that fit into main memory.