User: Guest  Login
Document type:
Report / Forschungsbericht 
Author(s):
Frank Kammer; Hanjo Täubig 
Title:
Graph Connectivity 
Abstract:
This work 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. We review algorithms which - check k-vertex (k-edge) connectivity, - compute the vertex (edge) connectivity, and - compute the maximal k-connected components of a given graph. After...    »
 
Keywords:
graph connectivity; efficient algorithms 
Year:
2004 
Pages:
47 
Language:
de 
Format:
Text