Connectivity

Chapter
Part of the Texts in Computer Science book series (TCS)

Abstract

An undirected graph is connected if there is a path between any pair of its vertices. In a digraph, connectivity implies there is a path between any two of its vertices in both directions. We start this chapter by defining the parameters of vertex and edge connectivity. We continue by describing algorithms to find cut-vertices and bridges of undirected graphs. We then review algorithms to find blocks of graphs and strongly connected components of digraphs. We describe the relationship between Connectivity, and network flows and matching and review sequential, parallel and distributed algorithms for all of the mentioned topics.

References

  1. 1.
    Aho AV, Hopcroft JE, Ullman JD (1983) Data Structures and Algorithms. Addison-WesleyGoogle Scholar
  2. 1.
    Akl SG (1989) The design and analysis of parallel algorithms. Prentice Hall, Englewood Cliffs, p 07632Google Scholar
  3. 2.
    Cormen TH, Leiserson CE, Rivest RL, Stein C (2009) Introduction to algorithms, 3rd edn. MIT Press, CambridgeGoogle Scholar
  4. 3.
    Esfahanian AH (1988) On the evolution of connectivity algorithms. In: Wilson R, Beineke L (eds) Selected topics in graph theory. Cambridge University Press, CambridgeGoogle Scholar
  5. 4.
    Esfahanian AH, Hakimi SL (1984) On computing the connectivities of graphs and digraphs. Networks 355–366Google Scholar
  6. 5.
    Even S (1979) Graph algorithms, Computer Science Press (Computer software engineering series). ISBN-10: 0914894218, ISBN-13: 978-0914894216Google Scholar
  7. 6.
    Even S, Tarjan RE (1975) Network flow and testing graph connectivity. SIAM J Comput 4:507–518MathSciNetCrossRefGoogle Scholar
  8. 7.
    Fleischer L, Hendrickson B, Pinar A (2000) On identifying strongly connected components in parallel. Parallel and distributed processing, pp 505–511Google Scholar
  9. 8.
    Grama A, Karypis G, Kumar V, Gupta A (2003) Introduction to parallel computing, 2nd edn. Addison-Wesley, New YorkGoogle Scholar
  10. 9.
    Hopcroft J, Tarjan R (1973) Algorithm 447: efficient algorithms for graph manipulation. Commun ACM 16(6):372–378CrossRefGoogle Scholar
  11. 10.
    Matula DW (1987) Determining edge connectivity in \(O(mn)\). In: Proceedings, 28th symposium on foundations of computer science, pp 249–251Google Scholar
  12. 11.
    McLendon W III, Hendrickson B, Plimpton SJ, Rauchwerger L (2005) Finding strongly connected components in distributed graphs. J Parallel Distrib Comput 65(8):901–910CrossRefGoogle Scholar
  13. 12.
    Tarjan RE (1972) Depth first search and linear graph algorithms. SIAM J Comput 1(2):146–160MathSciNetCrossRefGoogle Scholar
  14. 13.
    Tarjan RE (1974) A note on finding the bridges of a graph. Inf Process Lett 2(6):160–161MathSciNetCrossRefGoogle Scholar
  15. 14.
    Whitney H (1932) Congruent graphs and the connectivity of graphs. Am J Math 54:150–168MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer International Publishing AG, part of Springer Nature 2018

Authors and Affiliations

  1. 1.International Computer InstituteEge UniversityIzmirTurkey

Personalised recommendations