A constraint logic programming approach for generating all perfect matchings

✍ Scribed by F. Harary; G. Gupta

• Publisher: Elsevier Science
• Year: 2002
• Tongue: English
• Weight: 366 KB
• Volume: 15
• Category: Article
• ISSN: 0893-9659
• DOI: 10.1016/s0893-9659(02)00071-x

✦ Synopsis

In

[1,2], a heuristics based approach ia presented for finding all perfect matchings of a graph. We present a simpler and more elegant approach based on constraint logic programming that embodies the same heuristic.