A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
On the Complexity of a Filtering Problem for Constraint Programming: Decomposition by the Structure of Perfect Matchings
2019
Zenodo
Preserved Fulltext
A complexity analysis based on the structure of perfect matchings is given for the most efficient basic filtering algorithms in constraint programming with respect to the role of edges in matchings.
doi:10.5281/zenodo.3517166
fatcat:pt3x34mrbnghjo76n7t6klza2i