Finding all minimum-cost perfect matchings in Bipartite graphs (Q4014612): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: author (P16): Item:Q402373 |
||
| Property / author | |||
| Property / author: Tomomi Matsui / rank | |||
Revision as of 14:38, 14 February 2024
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
