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
21
23
views
downloads
All versions This version
Views 2121
Downloads 2323
Data volume 41.0 MB41.0 MB
Unique views 1919
Unique downloads 2121

Share

Cite as