Title of article
A constraint logic programming approach for generating all perfect matchings Original Research Article
Author/Authors
F. Harary، نويسنده , , G. Gupta، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2002
Pages
5
From page
969
To page
973
Abstract
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.
Journal title
Applied Mathematics Letters
Serial Year
2002
Journal title
Applied Mathematics Letters
Record number
897442
Link To Document