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 the normal view instead:
scientific article; zbMATH DE number 5544685
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8743081092834473
0 references
0.8557037711143494
0 references
0.8544931411743164
0 references
