Finding all minimum-cost perfect matchings in Bipartite graphs (Q4014612): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 01:47, 6 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
