Directed vertex-connectivity augmentation (Q1300059)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Directed vertex-connectivity augmentation |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Directed vertex-connectivity augmentation |
scientific article |
Statements
Directed vertex-connectivity augmentation (English)
0 references
10 April 2000
0 references
The authors continue the study of the problem of finding a smallest set of new edges to be added to a given digraph to make it \(k\)-vertex-connected. First they prove some theoretical results about this problem, and then they give a combinatorial algorithm which solves this problem optimally in time \(O(k^6)\), for every fixed \(k\geq 1\).
0 references
vertex-connectivity
0 references
digraph
0 references
combinatorial algorithm
0 references
