A Family of Bipartite
Cardinality Matching Problems Solvable in O(n^2) Time | J. Clausen, J. Krarup
| | Type | Journal paper [With referee] | | Journal | Nordic Journal of Computing | | Year | 1995 Vol. 2 pp. 496 - 501 | | BibTeX data | [bibtex] | | IMM Group(s) | Operations Research |
|