Benutzer: Gast  Login
Titel:

Graph Connectivity

Dokumenttyp:
Report / Forschungsbericht
Autor(en):
Frank Kammer; Hanjo Täubig
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...     »
Stichworte:
graph connectivity; efficient algorithms
Jahr:
2004
Seiten/Umfang:
47
Sprache:
de
Format:
Text
 BibTeX