Minimum augmentation of edge-connectivity between vertices and sets of vertices in undirected graphs (Q848841)
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: Minimum augmentation of edge-connectivity between vertices and sets of vertices in undirected graphs |
scientific article; zbMATH DE number 5674255
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimum augmentation of edge-connectivity between vertices and sets of vertices in undirected graphs |
scientific article; zbMATH DE number 5674255 |
Statements
Minimum augmentation of edge-connectivity between vertices and sets of vertices in undirected graphs (English)
0 references
23 February 2010
0 references
undirected graph
0 references
connectivity augmentation problem
0 references
edge-connectivity
0 references
node-to-area connectivity
0 references
polynomial time deterministic algorithm
0 references
edge-splitting
0 references
0 references
0.9980931878089904
0 references
0.9513919353485109
0 references
0.9267116785049438
0 references
