Covering symmetric supermodular functions with graph edges: a short proof of a theorem of Benczúr and Frank (Q2404617)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Covering symmetric supermodular functions with graph edges: a short proof of a theorem of Benczúr and Frank |
scientific article |
Statements
Covering symmetric supermodular functions with graph edges: a short proof of a theorem of Benczúr and Frank (English)
0 references
19 September 2017
0 references
edge-connectivity augmentation
0 references
crossing supermodular function
0 references
polynomial algorithm
0 references
graph algorithms
0 references
