Directed vertex-connectivity augmentation (Q1300059): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: reviewed by (P1447): Item:Q860608 |
||
| Property / reviewed by | |||
| Property / reviewed by: Ferdinand Gliviak / rank | |||
Revision as of 07:18, 21 February 2024
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
