Minimum augmentation of local edge-connectivity between vertices and vertex subsets in undirected graphs (Q860392)
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 local edge-connectivity between vertices and vertex subsets in undirected graphs |
scientific article; zbMATH DE number 5083141
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimum augmentation of local edge-connectivity between vertices and vertex subsets in undirected graphs |
scientific article; zbMATH DE number 5083141 |
Statements
Minimum augmentation of local edge-connectivity between vertices and vertex subsets in undirected graphs (English)
0 references
9 January 2007
0 references
undirected graph
0 references
connectivity augmentation problem
0 references
local edge-connectivity
0 references
node-to-area connectivity
0 references
polynomial time deterministic algorithm
0 references
0 references
0 references
