Binary constraint satisfaction problems defined by excluded topological minors - Université Toulouse III - Paul Sabatier - Toulouse INP Accéder directement au contenu
Article Dans Une Revue Information and Computation Année : 2019

Binary constraint satisfaction problems defined by excluded topological minors

Résumé

The binary Constraint Satisfaction Problem (CSP) is to decide whether there exists an assignment to a set of variables which satisfies specified constraints between pairs of variables. A binary CSP instance can be presented as a labelled graph encoding both the forms of the constraints and where they are imposed. We consider subproblems defined by restricting the allowed form of this graph. One type of restriction that has previously been considered is to forbid certain specified substructures (patterns). This captures some tractable classes of the CSP, but does not capture classes defined by language restrictions, or the well-known structural property of acyclicity. In this paper we extend the notion of pattern and introduce the notion of a topological minor of a binary CSP instance. By forbidding certain extended patterns from occurring as sub-patterns or as topological minors we obtain a compact mechanism for expressing all known tractable subproblems of the binary CSP defined by language or structural restrictions. We are also able to define several novel hybrid tractable classes, including new generalisations of the class of acyclic instances.

Dates et versions

hal-03311390 , version 1 (31-07-2021)

Identifiants

Citer

David Cohen, Martin Cooper, Peter Jeavons, Stanislav Živný. Binary constraint satisfaction problems defined by excluded topological minors. Information and Computation, 2019, 264, pp.12-31. ⟨10.1016/j.ic.2018.09.013⟩. ⟨hal-03311390⟩
37 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More