Abstract
We present an algorithm for maintaining the biconnected components of a graph during a sequence of edge insertions and deletions. It requires linear storage and preprocessing time. The amortized running time for insertions and for deletions isO(m 2/3 ), wherem is the number of edges in the graph. Any query of the form ‘Are the verticesu andv biconnected?’ can be answered in timeO(1). This is the first sublinear algorithm for this problem. We can also output all articulation points separating any two vertices efficiently.
If the input is a plane graph, the amortized running time for insertions and deletions drops toO(√n logn) and the query time isO(log2 n), wheren is the number of vertices in the graph. The best previously known solution takes timeO(n 2/3 ) per update or query.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
A. V. Aho, J. E. Hopcroft, and J. D. Ullman,The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974.
B. Alpern, R. Hoover, B. Rosen, P. Sweeney, and F. K. Zadeck, Incremental Evaluation of Computational Circuits,Proc. 1st Annual ACM-SIAM Symp. on Discrete Algorithms, 1990, pp. 32–42.
G. Ausiello and G. F. Italiano, On-Line Algorithms for Polynomially Solvable Satisfiability Problems,J. Logic Programming,10 (1991), 69–90.
M. D. Carrol and B. G. Ryder, Incremental Data Flow Analysis via Dominator and Attribute Updates,Proc. 15th Annual ACM SIGACT-SIGPLAN Symp. on Principles of Programming Languages, 1988, pp. 274–284.
D. Eppstein, G. F. Italiano, R. Tamassia, R. E. Tarjan, J. Westbrook, and M. Yung, Maintenance of a Minimum Spanning Forest in a Dynamic Planar Graph,Proc. 1st Annual Symp. on Discrete Algorithms 1990, pp. 1–11.
D. Eppstein, Z. Galil, G. F. Italiano, and A. Nissenzweig, Sparsification—A Technique for Speeding Up Dynamic Graph Algorithms,Proc. 32nd Annual Symp. on Foundations of Computer Science, 1992.
D. Eppstein, Z. Galil, and G. F. Italiano, Improved Sparsification, Technical Report 92-20, Department of Information and Computer Science, University of California, Irvine, CA, 1993.
G. N. Frederickson, Data Structures for On-Line Updating of Minimum Spanning Trees,SIAM J. Comput.,14 (1985), 781–798.
G. N. Frederickson, Ambivalent Data Structures for Dynamic 2-Edge-Connectivity andk Smallest Spanning Trees,Proc. 32nd Annual IEEE Symps. on Foundation of Computer Science, 1991, pp. 632–641.
Z. Galil and G. F. Italiano, Maintaining Biconnected Components of Dynamic Planar Graphs,Proc. 18th ICALP, Lecture Notes in Computer Science, Springer-Verlag, Berlin, 1991, pp. 339–350.
F. Harary,Graph Theory, Addison-Wesley, Reading, MA, 1969.
M. R. Henzinger and V. King, Randomized Dynamic Algorithms with Polylogarithmic Time per Operation, in preparation.
J. Hershberger, M. Rauch and S. Suri, Fully Dynamic 2-Edge-Connectivity in Planar Graphs,Proc. 3rd Scandinavian Workshop on Algorithm Theory, Lecture Notes in Computer Science, Vol. 621, Springer-Verlag, Berlin, 1992, pp. 233–244.
G. Italiano, Private communication.
D. D. Sleator and R. E. Tarjan, A Data Structure for Dynamic Trees,J. Comput. System Sci.,24 (1983), 362–381.
R. E. Tarjan, Depth First Search and Linear Graph Algorithms,SIAM J. Comput.,1 (1972), 146–160.
R. E. Tarjan and J. Westbrook, Maintaining Bridge-Connected and Biconnected Components On-Line,Algorithmica,7 (1992), 433–464.
M. Yannakakis, Graph Theoretic Methods in Database Theory,Proc. ACM Conf. on Principles of Database Systems, 1990, pp. 230–242.
Author information
Authors and Affiliations
Additional information
Communicated by A. Chi-Chih Yao.
Rights and permissions
About this article
Cite this article
Henzinger, M.R. Fully dynamic biconnectivity in graphs. Algorithmica 13, 503–538 (1995). https://doi.org/10.1007/BF01189067
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01189067