共 9 条
- [2] FINDING ALL MINIMUM-COST PERFECT MATCHINGS IN BIPARTITE GRAPHS [J]. NETWORKS, 1992, 22 (05) : 461 - 468
- [4] A Faster Algorithm for Minimum-Cost Bipartite Perfect Matching in Planar Graphs [J]. SODA'18: PROCEEDINGS OF THE TWENTY-NINTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2018, : 457 - 476
- [5] An optimal data association method based on the minimum weighted bipartite perfect matching [J]. Autonomous Robots, 2016, 40 : 77 - 91
- [7] Iterated Exact and Heuristic Algorithms for the Minimum Cost Bipartite Perfect Matching Problem with Conflict Constraints [J]. 2017 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT (IEEM), 2017, : 1032 - 1036
- [8] Sub-Classifier Construction for Error Correcting Output Code Using Minimum Weight Perfect Matching [J]. PROCEEDINGS OF THE 2014 INTERNATIONAL JOINT CONFERENCE ON NEURAL NETWORKS (IJCNN), 2014, : 3519 - 3525