Partition Constrained Covering of a Symmetric Crossing Supermodular Function by a Graph (Q2968515)
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: Partition Constrained Covering of a Symmetric Crossing Supermodular Function by a Graph |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Partition Constrained Covering of a Symmetric Crossing Supermodular Function by a Graph |
scientific article |
Statements
Partition Constrained Covering of a Symmetric Crossing Supermodular Function by a Graph (English)
0 references
16 March 2017
0 references
edge-connectivity augmentation
0 references
splitting off
0 references
connectivity function
0 references
