I/O-efficient topological sorting of planar DAGs

We present algorithms that solve a number of fundamental problems on planar directed graphs (planar digraphs) in O((N)) I/Os, where (N) is the number of I/Os needed to sort N elements. The problems we consider are breadth-first search, the single-source shortest path problem, computing a directed ear decomposition of a strongly connected planar digraph, computing an open directed ear decomposition of a strongly connected biconnected planar digraph, and topologically sorting a planar directed acyclic graph.

[1]  Norbert Zeh,et al.  An External Memory Data Structure for Shortest Path Queries , 1999, COCOON.

[2]  Kurt Mehlhorn,et al.  External-Memory Breadth-First Search with Sublinear I/O , 2002, ESA.

[3]  Ulrich Meyer,et al.  On External-Memory Planar Depth First Search , 2001, J. Graph Algorithms Appl..

[4]  Edward F. Grove,et al.  External-memory graph algorithms , 1995, SODA '95.

[5]  Norbert Zeh,et al.  I/O-optimal algorithms for planar graphs using separators , 2002, SODA '02.

[6]  Jörg-Rüdiger Sack,et al.  I/o-efficient algorithms for shortest path related problems , 2002 .

[7]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[8]  Jeffrey Scott Vitter,et al.  External memory algorithms and data structures: dealing with massive data , 2001, CSUR.

[9]  Ming-Yang Kao.  Linear-Processor NC Algorithms for Planar Directed Graphs I: Strongly Connected Components , 1993, SIAM J. Comput..

[10]  Lars Arge,et al.  The Buuer Tree: a New Technique for Optimal I/o-algorithms ? , 1995 .

[11]  Ming-Yang Kao,et al.  Linear-Processor NC Algorithms for Planar Directed Graphs II: Directed Spanning Trees , 1993, SIAM J. Comput..

[12]  Lars Arge,et al.  The Buffer Tree: A New Technique for Optimal I/O-Algorithms (Extended Abstract) , 1995, WADS.

[13]  Uzi Vishkin,et al.  Parallel Ear Decomposition Search (EDS) and st-Numbering in Graphs , 1986, Theor. Comput. Sci..

[14]  Norbert Zeh,et al.  An External Memory Data Structure for Shortest Path Queries , 1999, COCOON.

[15]  Alok Aggarwal,et al.  The input/output complexity of sorting and related problems , 1988, CACM.

[16]  Ming-Yang Kao,et al.  Towards overcoming the transitive-closure bottleneck: efficient parallel algorithms for planar digraphs , 1990, STOC '90.

[17]  Suresh Venkatasubramanian,et al.  On external memory graph traversal , 2000, SODA '00.

[18]  Lars Arge,et al.  On external-memory MST, SSSP and multi-way planar graph separation , 2000, J. Algorithms.

[19]  Jyh-Jong Tsay,et al.  External-memory computational geometry , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[20]  Vijay Kumar,et al.  Improved algorithms and data structures for solving graph problems in external memory , 1996, Proceedings of SPDP '96: 8th IEEE Symposium on Parallel and Distributed Processing.