A Fully Dynamic Data Structure for Reachability in Planar Digraphs

In this paper we investigate the problem of maintaining all-pairs reachability information in a planar digraph G as it undergoes changes. We give a fully dynamic O(n)-space data structure to support an arbitrary sequence of operations that consist of adding new edges (or nodes), deleting some existing edge, and querying to find out if a given node v is reachable in G by a directed path from another node u.

[1]  David Eppstein,et al.  Separator based sparsification for dynamic planar graph algorithms , 1993, STOC '93.

[2]  Gary L. Miller,et al.  Finding Small Simple Cycle Separators for 2-Connected Planar Graphs , 1986, J. Comput. Syst. Sci..

[3]  Giuseppe F. Italiano,et al.  Dynamic Data Structures for Series Parallel Digraphs (Preliminary Version) , 1989, WADS.

[4]  Greg N. Frederickson,et al.  Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications , 1985, SIAM J. Comput..

[5]  Jan van Leeuwen,et al.  Maintenance of Transitive Closures and Transitive Reductions of Graphs , 1987, WG.

[6]  Jeffrey Scott Vitter,et al.  A data structure for arc insertion and regular path finding , 1991, SODA '90.

[7]  Greg N. Frederickson,et al.  Data structures for on-line updating of minimum spanning trees , 1983, STOC.

[8]  Zvi Galil,et al.  Maintaining Biconnected Components of Dynamic Planar Graphs , 1991, ICALP.

[9]  Ioannis G. Tollis,et al.  Dynamic Reachability in Planar Digraphs with One Source and One Sink , 1993, Theor. Comput. Sci..

[10]  Giuseppe F. Italiano,et al.  Amortized Efficiency of a Path Retrieval Data Structure , 1986, Theor. Comput. Sci..

[11]  Zvi Galil,et al.  Fully dynamic planarity testing (extended abstract) , 1992, STOC '92.

[12]  Philip N. Klein,et al.  A Fully Dynamic Approximation Scheme for All-Pairs Shortest Paths in Planar Graphs , 1993, WADS.

[13]  T. Hiraguchi.  On the Dimension of Partially Ordered Sets. , 1951 .

[14]  Tiko Kameda,et al.  On the Vector Representation of the Reachability in Planar Directed Graphs , 1975, Inf. Process. Lett..

[15]  Giuseppe F. Italiano,et al.  Finding Paths and Deleting Edges in Directed Acyclic Graphs , 1988, Inf. Process. Lett..

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