• Dieter Jungnickel
Part of the Algorithms and Computation in Mathematics book series (AACIM, volume 5)


In the first chapter, we defined what ‘connected’ and ‘strongly connected’ means; we also introduced the notion of k-connectivity in Chapter 7. The Algorithm of Moore (BFS) we presented in Chapter 3 is an efficient method for determining the connected components of a graph. Now, in the present chapter, we mainly treat algorithmic questions concerning k-connectivity and strong connectivity for directed graphs. We develop a further strategy for searching (besides BFS), namely ‘Depth First Search’. This chapter also contains various theoretical results, for example characterizations of 2-connected graphs and of edge connectivity.


Directed Graph Connected Graph Directed Path Edge Incident Strong Component 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Dieter Jungnickel
    • 1
  1. 1.Lehrstuhl für Diskrete Mathematik, Optimierung und Operations ResearchUniversität AugsburgAugsburgGermany

Personalised recommendations