A constraint logic programming approach for generating all perfect matchings

DOI10.1016/S0893-9659(02)00071-XzbMath1050.68021OpenAlexW2052809551MaRDI QIDQ1861834

Yanyan Li

Publication date: 10 March 2003

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

Full work available at URL: https://doi.org/10.1016/s0893-9659(02)00071-x

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Logic programming (68N17)

Cites Work

• Finding all the perfect matchings in bipartite graphs
• Heuristic enhancements of the search for the generation of all perfect matchings
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A constraint logic programming approach for generating all perfect matchings