Finding all minimum-cost perfect matchings in Bipartite graphs (Q4014612)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding all minimum-cost perfect matchings in Bipartite graphs |
scientific article |
Statements
Finding all minimum-cost perfect matchings in Bipartite graphs (English)
0 references
13 October 1992
0 references
Hungarian method
0 references
minimal-cost perfect matching
0 references
weighted bipartite graph
0 references
