Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Jungnickel, D. (1999). Connectivity. In: Graphs, Networks and Algorithms. Algorithms and Computation in Mathematics, vol 5. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-03822-2_11
Download citation
DOI: https://doi.org/10.1007/978-3-662-03822-2_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-03824-6
Online ISBN: 978-3-662-03822-2
eBook Packages: Springer Book Archive