Ambivalent data structures for dynamic 2-edge-connectivity and k smallest spanning trees

Ambivalent data structures are presented for several problems on undirected graphs. They are used in finding the k smallest spanning trees of a weighted undirected graph in O(m log beta (m,n)+min(k/sup 3/2/, km/sup 1/2/)) time, where m is the number of edges and n the number of vertices in the graph. The techniques are extended to find the k smallest spanning trees in an embedded planar graph in O(n+k(log n)/sup 3/) time. Ambivalent data structures are also used to maintain dynamically 2-edge-connectivity information. Edges and vertices can be inserted or deleted in O(m/sup 1/2/) time, and a query as to whether two vertices are in the same 2-edge-connected component can be answered in O(log n) time, where m and n are understood to be the current number of edges and vertices, respectively. Again, the techniques are extended to maintain an embedded planar graph so that edges and vertices can be inserted or deleted in O((log n)/sup 3/) time, and a query answered in O(log n) time.<<ETX>>

[1]  Shimon Even,et al.  An On-Line Edge-Deletion Problem , 1981, JACM.

[2]  Robert E. Tarjan,et al.  Efficient algorithms for finding minimum spanning trees in undirected and directed graphs , 1986, Comb..

[3]  Robert E. Tarjan,et al.  Fibonacci heaps and their uses in improved network optimization algorithms , 1987, JACM.

[4]  Francis Y. L. Chin,et al.  Algorithms for Updating Minimal Spanning Trees , 1978, J. Comput. Syst. Sci..

[5]  Robert E. Tarjan,et al.  Sensitivity Analysis of Minimum Spanning Trees and Shortest Path Trees , 1982, Inf. Process. Lett..

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

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

[8]  David G. Kirkpatrick,et al.  A Simple Parallel Tree Contraction Algorithm , 1989, J. Algorithms.

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

[10]  Katta G. Murty,et al.  Letter to the Editor - An Algorithm for Ranking all the Assignments in Order of Increasing Cost , 1968, Oper. Res..

[11]  Uzi Vishkin,et al.  On Finding Lowest Common Ancestors: Simplification and Parallelization , 1988, AWOC.

[12]  Matthias F. Stallmann,et al.  Efficient Algorithms for Graphic Matroid Intersection and Parity (Extended Abstract) , 1985, ICALP.

[13]  Harold N. Gabow,et al.  Two Algorithms for Generating Weighted Spanning Trees in Order , 1977, SIAM J. Comput..

[14]  Robert E. Tarjan,et al.  Applications of Path Compression on Balanced Trees , 1979, JACM.

[15]  E. Lawler.  A PROCEDURE FOR COMPUTING THE K BEST SOLUTIONS TO DISCRETE OPTIMIZATION PROBLEMS AND ITS APPLICATION TO THE SHORTEST PATH PROBLEM , 1972 .

[16]  David Eppstein,et al.  Finding thek smallest spanning trees , 1992 .

[17]  Toshihide Ibaraki,et al.  An Algorithm for Finding K Minimum Spanning Trees , 1981, SIAM J. Comput..

[18]  Eugene Lawler,et al.  Combinatorial optimization , 1976 .

[19]  Robert E. Tarjan,et al.  Making data structures persistent , 1986, STOC '86.

[20]  Manuel Blum,et al.  Time Bounds for Selection , 1973, J. Comput. Syst. Sci..

[21]  Robert E. Tarjan,et al.  Fast Algorithms for Finding Nearest Common Ancestors , 1984, SIAM J. Comput..

[22]  A. Pan,et al.  On Finding and Updating Spanning Trees and Shortest Paths , 1975, SIAM J. Comput..

[23]  J. Y. Yen.  Finding the K Shortest Loopless Paths in a Network , 1971 .

[24]  Robert E. Tarjan,et al.  Finding Minimum Spanning Trees , 1976, SIAM J. Comput..

[25]  Zvi Galil,et al.  Fully Dynamic Algorithms for 2-Edge Connectivity , 1992, SIAM J. Comput..

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

[27]  K. G. Murty.  An Algorithm for Ranking All the Assignment in Order of Increasing Cost , 1968 .

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