A Weighted <i>k<sub>t, t</sub></i>-Free <i>t</i>-Factor Algorithm for Bipartite Graphs (Q3169039): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 05:30, 4 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Weighted <i>k<sub>t, t</sub></i>-Free <i>t</i>-Factor Algorithm for Bipartite Graphs |
scientific article |
Statements
A Weighted <i>k<sub>t, t</sub></i>-Free <i>t</i>-Factor Algorithm for Bipartite Graphs (English)
0 references
27 April 2011
0 references
square-free 2-factor
0 references
\(K_{t,t}\)-free t-factor
0 references
combinatorial primal-dual algorithm
0 references
dual integrality
0 references
