3517166
doi
10.5281/zenodo.3517166
oai:zenodo.org:3517166
user-innorenew
user-eu
Miklós Krész
InnoRenew CoE
On the Complexity of a Filtering Problem for Constraint Programming: Decomposition by the Structure of Perfect Matchings
Radoslaw Cymer
Universität Augsburg
info:eu-repo/semantics/openAccess
Creative Commons Attribution 4.0 International
https://creativecommons.org/licenses/by/4.0/legalcode
constraint programming
matching theory
decomposition theory
<p>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.</p>
Pages 94-100
Zenodo
2019-09-27
info:eu-repo/semantics/conferencePaper
3517165
user-innorenew
user-eu
award_title=Renewable materials and healthy environments research and innovation centre of excellence; award_number=739574; award_identifiers_scheme=url; award_identifiers_identifier=https://cordis.europa.eu/projects/739574; funder_id=00k4n6c32; funder_name=European Commission;
1579534203.424961
1783701
md5:7aa3ebbaf5e8e361d609a6c54c450835
https://zenodo.org/records/3517166/files/SOR'19 - ON THE COMPLEXITY.pdf
public
10.5281/zenodo.3517165
isVersionOf
doi