Binary constraint satisfaction problems defined by excluded topological minors
- Submitting institution
-
University of Oxford
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 2000
- Type
- D - Journal article
- DOI
-
10.1016/j.ic.2018.09.013
- Title of journal
- Information and Computation
- Article number
- -
- First page
- 12
- Volume
- 264
- Issue
- -
- ISSN
- 0890-5401
- Open access status
- Compliant
- Month of publication
- September
- Year of publication
- 2018
- URL
-
-
- 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)
-
-
- Citation count
- 3
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- Analysing the complexity of constraint satisfaction problems has led to many new links between algebra, logic, and graph theory, as well as influencing the design of constraint-solving software. This paper opens a new direction in this research by introducing the idea of using topological minors, and showing that this concept is sufficiently powerful to unify most known structural classes and language-based classes, and to suggest extensions of both. This is an extended version of a paper first presented at the 24th International Joint Conference on Artificial Intelligence (IJCAI 2015).
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -