On Maximum Cost $K_{t,t}$‐Free <i>t</i>‐Matchings of Bipartite Graphs (Q3503219)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On Maximum Cost $K_{t,t}$‐Free <i>t</i>‐Matchings of Bipartite Graphs |
scientific article |
Statements
On Maximum Cost $K_{t,t}$‐Free <i>t</i>‐Matchings of Bipartite Graphs (English)
0 references
22 May 2008
0 references
submodularity
0 references
restricted matchings
0 references
integer polyhedra
0 references
