I/O-optimal algorithms for planar graphs using separators

We present I/O-optimal algorithms for several fundamental problems on planar graphs. Our main contribution is an I/O-efficient algorithm for computing a small vertex separator of an unweighted planar graph. This algorithm is superior to all existing external memory algorithms for this problem, as it requires neither a breadth-first search tree nor an embedding of the graph as part of the input. In fact, we derive I/O-optimal algorithms for planar embedding, breadth-first search, depth-first search, single source shortest paths, and computing weighted separators of planar graphs from our unweighted separator algorithm.

[1]  Norbert Zeh,et al.  I/O-Efficient Algorithms for Graphs of Bounded Treewidth , 2001, SODA '01.

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

[3]  Norbert Zeh,et al.  External Memory Algorithms for Outerplanar Graphs , 1999, ISAAC.

[4]  Robert E. Tarjan,et al.  Dividing a Graph into Triconnected Components , 1973, SIAM J. Comput..

[5]  Ulrich Meyer.  External memory BFS on undirected graphs with bounded degree , 2001, SODA '01.

[6]  H. Whitney.  Congruent Graphs and the Connectivity of Graphs , 1932 .

[7]  John M. Boyer,et al.  Stop minding your p's and q's: a simplified O(n) planar embedding algorithm , 1999, SODA '99.

[8]  T. M. Murali,et al.  I/O-efficient algorithms for contour-line extraction and planar graph blocking , 1998, SODA '98.

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

[10]  Hristo Djidjev,et al.  Linear Algorithms for Partitioning Embedded Graphs of Bounded Genus , 1996, SIAM J. Discret. Math..

[11]  Robert E. Tarjan,et al.  Efficient Planarity Testing , 1974, JACM.

[12]  N. Zeh.  I/O-Efficient Planar Separators and Applications , 2001 .

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

[14]  Jeffery R. Westbrook,et al.  A Functional Approach to External Graph Algorithms , 1998, ESA.

[15]  N. Zeh.  I/O-Optimal Planar Embedding Using Graph Separators , 2001 .

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

[17]  Jeffrey Scott Vitter,et al.  External memory algorithms and data structures , 1999, External Memory Algorithms.

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

[19]  Kamesh Munagala,et al.  I/O-complexity of graph algorithms , 1999, SODA '99.

[20]  Philip N. Klein,et al.  Faster Shortest-Path Algorithms for Planar Graphs , 1997, J. Comput. Syst. Sci..

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

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

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