Augmenting Graphs to Meet Edge-Connectivity Requirements (Q3989009)
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: Augmenting Graphs to Meet Edge-Connectivity Requirements |
scientific article; zbMATH DE number 33675
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Augmenting Graphs to Meet Edge-Connectivity Requirements |
scientific article; zbMATH DE number 33675 |
Statements
Augmenting Graphs to Meet Edge-Connectivity Requirements (English)
0 references
28 June 1992
0 references
combinatorial optimization
0 references
edge-connectivity
0 references
polynomial time algorithm
0 references
splitting theorems
0 references
polymatroids
0 references
0.8467260599136353
0 references
0.8448176383972168
0 references
0.8443552255630493
0 references
0.8366371989250183
0 references
