Skip to main content
SpringerLink
Log in

Maintenance of triconnected components of graphs

Extended abstract

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1992)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 623))

Included in the following conference series:

Abstract

In this paper, optimal algorithms and data structures are presented to maintain the triconnected components of a general graph, under insertions of edges in the graph. At any moment, the data structure can answer the following type of query: given two nodes in the graph, are these nodes triconnected. Starting from an “empty” graph of n nodes (i.e., a graph with no edges) the solution runs in O(n + m.α(m, n)) total time, where m is the total number of queries and edge insertions. The solution allows for insertions of nodes also.

At Princeton University, the research was supported by a NATO Science Fellowship awarded by N.W.O., and partially supported by DIMACS (Center for Discrete Mathematics and Theoretical Computer Science), a National Science Foundation Science and Technology Center -NSF-STC88-09648. At Utrecht University, the research was partially supported by the ESPRIT Basic Research Actions of the E.C. under contract no. 3075 (project ALCOM).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. G. Ausiello, G.F. Italiano, A. Marchetti Spaccamela, and U. Nanni, Incremental Algorithms for Minimal Length Paths, Proc. 1st Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA) 1990, 12–21.

    Google Scholar 

  2. G. Di Battista and R. Tamassia, Incremental Planarity Testing, Proc. 30th Ann. Symp. on Found. of Comp. Sci. (FOCS) 1989, 436–441.

    Google Scholar 

  3. G. Di Battista and R. Tamassia, On-Line Graph Algorithms with SPQR-Trees, Proc. 17th Int. Colloquium on Automata, Languages and Programming (ICALP) 1990, 598–611.

    Google Scholar 

  4. 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 Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA) 1990, 1–11.

    Google Scholar 

  5. G.N. Frederickson, Data structures for on-line updating of minimum spanning trees, with applications, SIAM J. Computing 14 (1985), pp. 781–798.

    Google Scholar 

  6. M.L. Fredman and M.E. Saks, The Cell-Probe Complexity of Dynamic Data Structures, Proc. 21th Ann. ACM Symp. on Theory of Comput. (STOC) 1989, 345–354

    Google Scholar 

  7. H.N. Gabow, A Scaling Algorithm for Weighted Matching on General Graphs, Proc. 26th Ann. Symp. on Found. of Comp. Sci. (FOCS) 1985, 90–100.

    Google Scholar 

  8. H.N. Gabow, Data Structures for Weighted Matching and Nearest Common Ancestors with Linking, Proc. 1st Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA) 1990, 434–443.

    Google Scholar 

  9. H.N. Gabow and R.E. Tarjan, A Linear Time Algorithm for a Special Case of Disjoint Set Union, J. Comput. Syst. Sci. 30 (1985), 209–221.

    Article  Google Scholar 

  10. Z. Galil and G.F.Italiano, Fully Dynamic Algorithms for Edge Connectivity Problems, Proc. 23th Ann. ACM Symp. on the Theory of Computing (STOC) 1991.

    Google Scholar 

  11. F. Harary, Graph Theory, Addison-Wesley Publishing Company, Reading, Mass., 1969.

    Google Scholar 

  12. J. Hopcroft and R.E. Tarjan, Dividing a graph into Triconnected Components, SIAM J. Comput. 2 (1973).

    Google Scholar 

  13. G.F. Italiano, Amortized efficiency of a path retrieval data structure, Theoretical Computer Science, 48, (1986), pp. 273–281.

    Article  Google Scholar 

  14. G.F. Italiano, Finding paths and deleting edges in directed acyclic graphs, Information Processing Letters, 28, (1988), pp. 5–11.

    Google Scholar 

  15. J.A. La Poutré and J. van Leeuwen, Maintenance of Transitive Closures and Transitive Reductions of Graphs, In: H. Göttler, H.J. Schneider (Eds.), Graph-Theoretic Concepts in Computer Science 1987, Lecture Notes in Computer Science Vol. 314, Springer-Verlag, Berlin, pp. 106–120.

    Google Scholar 

  16. J.A. La Poutré, New Techniques for the Union-Find Problem, Proc. 1st Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA) 1990, 54–63.

    Google Scholar 

  17. J.A. La Poutré, Lower Bounds for the Union-Find and the Split-Find Problem on Pointer Machines, Proc. 22th Ann. ACM Symp. on Theory of Comput. (STOC) 1990, 34–44.

    Google Scholar 

  18. J.A. La Poutré, J. van Leeuwen and M.H. Overmars, Maintenance of 2-and 3-connected components of graphs, Part I: 2-and 3-edge-connected components, Tech. Rep. RUU-CS-90-26, Utrecht University, 1990.

    Google Scholar 

  19. J.A. La Poutré, Maintenance of 2-and 3-connected components of graphs, Part II: 2-and 3-edge-connected components and 2-vertex-connected components, Tech. Rep. RUU-CS-90-27, Utrecht University, 1990.

    Google Scholar 

  20. J.A. La Poutré, Dynamic Graph Algorithms and Data Structures, Ph.D. Thesis, Utrecht University, 1991.

    Google Scholar 

  21. J.A. La Poutré, Fast Deterministic Algorithms for Incremental Planarity Testing, Princeton University, in preparation.

    Google Scholar 

  22. F.P. Preparata and R. Tamassia, Fully Dynamic Techniques for Point Location and Transitive Closure in Planar Structures, Proc. 29th Ann. Symp. on Found. of Comp. Sci. (FOCS) 1988, pp. 558–567.

    Google Scholar 

  23. H. Rohnert, A dynamization of the all pairs least cost path problem, In: K. Mehlhorn (ed.), 2nd Annual Symposium on Theoretical Aspects of Computer Science 1985, Lecture Notes in Computer Science Vol. 182, Springer-Verlag, Berlin, pp. 279–286.

    Google Scholar 

  24. R.E. Tarjan, Depth-First Search and Linear Graph Algorithms, SIAM J. Comput. 1 (1972) 146–160.

    Article  Google Scholar 

  25. W. Tutte, Connectivity in Graphs, University of Toronto Press, 1966.

    Google Scholar 

  26. J. Westbrook and R.E. Tarjan, Maintaining Bridge-Connected and Biconnected Components On-Line, Tech. rep. CS-TR-228-89, Princeton University, 1989 (to appear in Algorithmica).

    Google Scholar 

  27. J. Westbrook, Fast Incremental Planarity Testing, Proc. 19th Int. Colloquium on Automata, Languages and Programming (ICALP) 1992.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Princeton University, 08544, Princeton, NJ, USA

    J. A. La Poutré

  2. Department of Computer Science, Utrecht University, 3508, TB Utrecht, The Netherlands

    J. A. La Poutré

Authors
  1. J. A. La Poutré
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

W. Kuich

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

La Poutré, J.A. (1992). Maintenance of triconnected components of graphs. In: Kuich, W. (eds) Automata, Languages and Programming. ICALP 1992. Lecture Notes in Computer Science, vol 623. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55719-9_87

Download citation

  • DOI: https://doi.org/10.1007/3-540-55719-9_87

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55719-7

  • Online ISBN: 978-3-540-47278-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation