Conference paper Open Access
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.
Name | Size | |
---|---|---|
SOR'19 - ON THE COMPLEXITY.pdf
md5:7aa3ebbaf5e8e361d609a6c54c450835 |
1.8 MB | Download |
All versions | This version | |
---|---|---|
Views | 44 | 44 |
Downloads | 69 | 69 |
Data volume | 123.1 MB | 123.1 MB |
Unique views | 40 | 40 |
Unique downloads | 66 | 66 |