Finding a complete matching with the maximum product on weighted bipartite graphs (Q2365954)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Finding a complete matching with the maximum product on weighted bipartite graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding a complete matching with the maximum product on weighted bipartite graphs |
scientific article |
Statements
Finding a complete matching with the maximum product on weighted bipartite graphs (English)
0 references
29 June 1993
0 references
bipartite matching problem
0 references
algorithm
0 references
Hungarian method
0 references
