A Dual Algorithm for Optimum Matching |
Received:September 15, 1981 Revised:April 06, 1982 |
Key Words:
|
Fund Project: |
|
Hits: 1762 |
Download times: 1292 |
Abstract: |
An algorithm for finding a maximum weight perfect matching in a graph is described. It may be used for finding a maximum weight matching and a matching of maximum cardinality with maximum weight in a graph. |
Citation: |
DOI:10.3770/j.issn:1000-341X.1985.04.023 |
View Full Text View/Add Comment |