A constraint logic programming approach for generating all perfect matchings Original Research Article

In [1,2], a heuristics based approach is 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.