Two-Vertex Connectivity Augmentations for Graphs with a Partition Constraint (Extended Abstract) (Q3652304)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5649471
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two-Vertex Connectivity Augmentations for Graphs with a Partition Constraint (Extended Abstract) |
scientific article; zbMATH DE number 5649471 |
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
0 references
0.90839475
0 references
0.8994786
0 references
0.8978057
0 references
0.8910427
0 references
0.8900674
0 references
0.8900674
0 references
0.88717884
0 references
