Faster scaling algorithms for general graph matching problems 论文
1991Journal of the ACM引用 306
Complexity and Algorithms in GraphsOptimization and Search ProblemsAdvanced Graph Theory Research
摘要
An algorithm for minimum-cost matching on a general graph with integral edge costs is