Finding all minimum-cost perfect matchings in Bipartite graphs (Q4014612)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 68867
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding all minimum-cost perfect matchings in Bipartite graphs |
scientific article; zbMATH DE number 68867 |
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
0.8756441473960876
0 references
0.839681088924408
0 references
0.7958663105964661
0 references
