Abstract
This chapter is mainly concerned with the strength of connections between vertices with respect to the number of vertex- or edge-disjoint paths. As we shall see, this is equivalent to the question of how many nodes or edges must be removed from a graph to destroy all paths between two (arbitrary or specified) vertices.
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
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Kammer, F., Täubig, H. (2005). Connectivity. In: Brandes, U., Erlebach, T. (eds) Network Analysis. Lecture Notes in Computer Science, vol 3418. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31955-9_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-31955-9_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24979-5
Online ISBN: 978-3-540-31955-9
eBook Packages: Computer ScienceComputer Science (R0)