A constraint logic programming approach
✍
F. Harary; G. Gupta
📂
Article
📅
2002
🏛
Elsevier Science
🌐
English
⚖ 366 KB
## 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.