论文信息 - Fully Dynamic 2-Edge-Connectivity in Planar Graphs

Fully Dynamic 2-Edge-Connectivity in Planar Graphs

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

Subhash Suri | John Hershberger | Monika Henzinger

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

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

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

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

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

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

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

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

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

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

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