Conference paper Open Access

On the Complexity of a Filtering Problem for Constraint Programming: Decomposition by the Structure of Perfect Matchings

Radoslaw Cymer; Miklós Krész

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.

Pages 94-100
Files (1.8 MB)
Name Size
SOR'19 - ON THE COMPLEXITY.pdf
md5:7aa3ebbaf5e8e361d609a6c54c450835
1.8 MB Download
44
69
views
downloads
All versions This version
Views 4444
Downloads 6969
Data volume 123.1 MB123.1 MB
Unique views 4040
Unique downloads 6666

Share

Cite as