Heuristic enhancements of the search for the generation of all perfect matchings

DOI10.1016/0893-9659(96)00011-0zbMath0851.68040OpenAlexW2021300239MaRDI QIDQ1921169

P. Venuvanalingam, M. M. Balakrishnarajan

Publication date: 11 August 1996

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0893-9659(96)00011-0

zbMATH Keywords

heuristicsperfect matchings

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (1)

A constraint logic programming approach for generating all perfect matchings

Cites Work

• Unnamed Item
• Algorithms for finding k-best perfect matchings
• Finding all the perfect matchings in bipartite graphs
• The Complexity of Enumeration and Reliability Problems
• Finding all minimum-cost perfect matchings in Bipartite graphs
• Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing Cost

This page was built for publication: Heuristic enhancements of the search for the generation of all perfect matchings