Minimum augmentation of edge-connectivity with monotone requirements in undirected graphs (Q1013291)
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 with monotone requirements in undirected graphs |
scientific article; zbMATH DE number 5544685
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimum augmentation of edge-connectivity with monotone requirements in undirected graphs |
scientific article; zbMATH DE number 5544685 |
Statements
Minimum augmentation of edge-connectivity with monotone requirements in undirected graphs (English)
0 references
17 April 2009
0 references
undirected graph
0 references
connectivity augmentation problem
0 references
monotone requirement
0 references
polynomial time deterministic algorithm
0 references
0 references
0 references
