Two-Vertex Connectivity Augmentations for Graphs with a Partition Constraint (Extended Abstract) (Q3652304): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 07:25, 5 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Two-Vertex Connectivity Augmentations for Graphs with a Partition Constraint (Extended Abstract) |
scientific article |
Statements
Two-Vertex Connectivity Augmentations for Graphs with a Partition Constraint (Extended Abstract) (English)
0 references
17 December 2009
0 references
two-vertex connectivity augmentation problem
0 references
linear time algorithm
0 references
