Published September 27, 2019
| Version v1
Conference paper
Open
On the Complexity of a Filtering Problem for Constraint Programming: Decomposition by the Structure of Perfect Matchings
Description
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.
Notes
Pages 94-100
Files
SOR'19 - ON THE COMPLEXITY.pdf
Files
(1.8 MB)
| Name | Size | Download all |
|---|---|---|
|
md5:7aa3ebbaf5e8e361d609a6c54c450835
|
1.8 MB | Preview Download |
Additional details
Identifiers
- ISBN
- 978-961-6165-55-6