Constraint satisfaction problems for reducts of homogeneous graphs
- Submitting institution
-
University of Durham
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 123383
- Type
- D - Journal article
- DOI
-
10.1137/16M1082974
- Title of journal
- SIAM Journal on Computing
- Article number
- -
- First page
- 1224
- Volume
- 48
- Issue
- 4
- ISSN
- 00975397
- Open access status
- Compliant
- Month of publication
- -
- Year of publication
- 2019
- URL
-
https://doi.org/10.1137/16M1082974
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
3
- Research group(s)
-
B - Algorithms and Complexity
- Citation count
- 4
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- Completes the dichotomy-between-P-and-NP-complete classification of computational complexity for Constraint Satisfaction Problems (CSPs) over reducts of homogeneous graphs, begun in the paper "Schaefer's Theorem for Graphs" (JACM 2015: 10.1145/2764899). Homogeneous graphs is a large natural class unifying various previous classifications (JACM 2015, CSL 2012: 10.4230/LIPIcs.CSL.2012.122). The next step is finitely bounded homogeneous structures for which there is a dichotomy conjecture (LICS 2016/2017: see 10.1145/2933575.2934544). The homogeneous graphs classification gives significant support to the conjecture. This paper appears at https://sinews.siam.org/Details-Page/have-you-seen-the-most-cited-simax-and-sicomp-papers-lately-2#SICOMP among the 20 most cited Sicomp papers published since 2018.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -