Directed vertex-connectivity augmentation (Q1300059): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
| (5 intermediate revisions by 4 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1007/s101070050038 / rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Ferdinand Gliviak / rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Ferdinand Gliviak / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s101070050038 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2148988287 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S101070050038 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 17:44, 10 December 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
