Maintaining biconnected components of dynamic planar graphs

  • Zvi Galil
  • Giuseppe F. Italiano
Graph Algorithms (Session 8)
Part of the Lecture Notes in Computer Science book series (LNCS, volume 510)


We present algorithms for maintaining the biconnected components of a planar graph undergoing repeated dynamic modifications, such as insertions and deletions of edges and vertices. We show how to test at any time whether two vertices belong to the same biconnected component, and how to insert and delete an edge in O(n2/3) time in the worst case, where n is the number of vertices in the graph. The data structure supports also insertions of new vertices and deletions of disconnected vertices in the same time bounds. This is the first sublinear-time algorithm known for this problem.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    A. V. Aho, J. E. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974.Google Scholar
  2. [2]
    G. Ausiello, G. F. Italiano, A. Marchetti-Spaccamela, U. Nanni, “Incremental algorithms for minimal length paths”, J. Algorithms, to appear.Google Scholar
  3. [3]
    G. Di Battista, and R. Tamassia, “Incremental planarity testing”, Proc. 30th Annual Symp. on Foundations of Computer Science, 1989, 436–441.Google Scholar
  4. [4]
    G. Di Battista, and R. Tamassia, “On-line graph algorithms with SPQR-trees”, Proc. 17th Int. Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science 443, Springer-Verlag, Berlin, 1990, 598–611.Google Scholar
  5. [5]
    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. First Annual ACM-SIAM Symp. on Discrete Algorithms, 1990, 1–11.Google Scholar
  6. [6]
    S. Even, and H. Gazit, “Updating distances in dynamic graphs”, Methods of Operations Research 49 (1985), 371–387.Google Scholar
  7. [7]
    S. Even, and Y. Shiloach, “An on-line edge deletion problem”, J. Assoc. Comput. Mach. 28 (1981), 1–4.Google Scholar
  8. [8]
    G. N. Frederickson, “Data structures for on-line updating of minimum spanning trees”, SIAM J. Comput. 14 (1985), 781–798.Google Scholar
  9. [9]
    Z. Galil, and G. F. Italiano, “Fully dynamic algorithms for edge connectivity problems”, Proc. 23rd Annual ACM Symp. on Theory of Computing, 1991.Google Scholar
  10. [10]
    F. Harary, Graph Theory, Addison-Wesley, Reading, MA, 1969.Google Scholar
  11. [11]
    G. F. Italiano, “Amortized efficiency of a path retrieval data structure”, Theoret. Comput. Sci. 48 (1986), 273–281.Google Scholar
  12. [12]
    G. F. Italiano, “Finding paths and deleting edges in directed acyclic graphs”, Inform. Process. Lett. 28 (1988), 5–11.Google Scholar
  13. [13]
    J. A. La Poutré, and J. van Leeuwen, “Maintenance of transitive closure and transitive reduction of graphs”, Proc. Workshop on Graph-Theoretic Concepts in Computer Science, Lecture Notes in Computer Science, vol. 314, Springer-Verlag, Berlin, 1988, 106–120.Google Scholar
  14. [14]
    F. P. Preparata, and R. Tamassia, “Fully dynamic techniques for point location and transitive closure in planar structures”, Proc. 29th Annual Symp. on Foundations of Computer Science, 1988, 558–567.Google Scholar
  15. [15]
    J. H. Reif, “A topological approach to dynamic graph connectivity”, Inform. Process. Lett. 25 (1987), 65–70.Google Scholar
  16. [16]
    H. Rohnert, “A dynamization of the all pairs least cost path problem”, Proc. 2nd Annual Symp. on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, vol. 182, Springer-Verlag, Berlin, 1985, 279–286.Google Scholar
  17. [17]
    D. D. Sleator, and R. E. Tarjan, “A data structure for dynamic trees”, J. Comput. System Sci. 24 (1983), 362–381.Google Scholar
  18. [18]
    R. E. Tarjan, “Depth first search and linear graph algorithms”, SIAM J. Comput. 1 (1972), 149–160.Google Scholar
  19. [19]
    R. E. Tarjan, and J. van Leeuwen, “Worst case analysis of set union algorithms”, J. Assoc. Comput. Mach. 31 (1984), 245–281.Google Scholar
  20. [20]
    R. E. Tarjan, and U. Vishkin, “An efficient parallel biconnectivity algorithm”, SIAM J. Comput. 14 (1985), 862–864.Google Scholar
  21. [21]
    J. Westbrook, and R. E. Tarjan, “Maintaining bridge-connected and biconnected components on-line”, Tech. Rep. CS-TR-228-89, Department of Computer Science, Princeton University, August 1989. To appear in Algorithmica.Google Scholar
  22. [22]
    D. M. Yellin, “A dynamic transitive closure algorithm”, Research Report, IBM Research Division, T. J. Watson Research Center, 1988.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Zvi Galil
    • 1
    • 2
  • Giuseppe F. Italiano
    • 1
    • 3
  1. 1.Columbia UniversityUSA
  2. 2.Tel-Aviv UniversityIsrael
  3. 3.Università di RomaItaly

Personalised recommendations