Computing Vertex Connectivity: New Bounds from Old Techniques

The vertex connectivity κ of a graph is the smallest number of vertices whose deletion separates the graph or makes it trivial. We present the fastest known deterministic algorithm for finding the vertex connectivity and a corresponding separator. The time for a digraph having n vertices and m edges...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of algorithms Jg. 34; H. 2; S. 222 - 250
Hauptverfasser:	Henzinger, Monika R., Rao, Satish, Gabow, Harold N.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	San Diego, CA Elsevier Inc 01.02.2000 Elsevier
Schlagworte:	Combinatorics Combinatorics. Ordered structures Exact sciences and technology Graph theory Mathematics Sciences and techniques of general use Distance function Vertex connectivity Connectedness Graph theory Algorithm Directed graph Weighted graph Non directed graph
ISSN:	0196-6774, 1090-2678
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!