Data Structures for Two-Edge Connectivity in Planar Graphs

Abstract We present a data structure for maintaining 2-edge connectivity information dynamically in an embedded planar graph. The data structure requires linear storage and preprocessing time for its construction, supports online updates (deletion of an edge or insertion of an edge consistent with the embedding) in O(log 2 n ) time, and answers a query (whether two vertices are in the same 2-edge-connected component) in O(log n ) time. The previous best algorithm for this problem requires O(log 3 n ) time for updates.

[1]  Gary L. Miller,et al.  A new graphy triconnectivity algorithm and its parallelization , 1987, STOC.

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

[3]  Subhash Suri,et al.  Fully Dynamic 2-Edge-Connectivity in Planar Graphs , 1992, SWAT.

[4]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

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

[6]  David Eppstein,et al.  Maintenance of a minimum spanning forest in a dynamic planar graph , 1990, SODA '90.

[7]  Robert E. Tarjan,et al.  Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..

[8]  Robert E. Tarjan,et al.  An Efficient Parallel Biconnectivity Algorithm , 2011, SIAM J. Comput..

[9]  Zvi Galil,et al.  Reducing edge connectivity to vertex connectivity , 1991, SIGA.

[10]  Frank Harary,et al.  Graph Theory , 2016 .

[11]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[12]  Greg N. Frederickson,et al.  Ambivalent data structures for dynamic 2-edge-connectivity and k smallest spanning trees , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[13]  Zvi Galil,et al.  Fully dynamic algorithms for edge connectivity problems , 1991, STOC '91.

[14]  Zvi Galil,et al.  A Note on Set Union with Arbitrary Deunions , 1991, Inf. Process. Lett..

[15]  Robert E. Tarjan,et al.  Data structures and network algorithms , 1983, CBMS-NSF regional conference series in applied mathematics.

[16]  Gary L. Miller,et al.  A new graph triconnectivity algorithm and its parallelization , 1992, Comb..

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

[18]  Giuseppe F. Italiano,et al.  Fully Dynamic Planarity Testing in Planar Embedded Graphs (Extended Abstract) , 1993, ESA.

[19]  David Eppstein,et al.  Sparsification-a technique for speeding up dynamic graph algorithms , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

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