Simplified External Memory Algorithms for Planar DAGs

In recent years a large number I/O-efficient algorithms have been developed for fundamental planar graph problems. Most of these algorithms rely on the existence of small planar separators as well as an O(sort(N)) I/O algorithm for computing a partition of a planar graph based on such separators, where O(sort(N)) is the number of I/Os needed to sort N elements.

[1]  R. Tarjan,et al.  A Separator Theorem for Planar Graphs , 1977 .

[2]  Greg N. Frederickson,et al.  Fast Algorithms for Shortest Paths in Planar Graphs, with Applications , 1987, SIAM J. Comput..

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

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

[5]  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.

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

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

[8]  Jeffrey Scott Vitter,et al.  I/O-Efficient Algorithms for Problems on Grid-Based Terrains , 2001, JEAL.

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

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

[11]  Lars Arge,et al.  External memory graph algorithms and applications to geographic information systems , 2003 .

[12]  Norbert Zeh,et al.  I/O-efficient strong connectivity and depth-first search for directed planar graphs , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[13]  Ulrich Meyer,et al.  Algorithms for Memory Hierarchies , 2003, Lecture Notes in Computer Science.

[14]  Norbert Zeh,et al.  I/O-efficient topological sorting of planar DAGs , 2003, SPAA '03.