On the Algebraic Structure of Combinatorial Problems

Abstract We describe a general algebraic formulation for a wide range of combinatorial problems including Satisfiability, Graph Colorability and Graph Isomorphism In this formulation each problem instance is represented by a pair of relational structures, and the solutions to a given instance are homomorphisms between these relational structures. The corresponding decision problem consists of deciding whether or not any such homomorphisms exist. We then demonstrate that the complexity of solving this decision problem is determined in many cases by simple algebraic properties of the relational structures involved. This result is used to identify tractable subproblems of Satisfiability , and to provide a simple test to establish whether a given set of Boolean relations gives rise to one of these tractable subproblems.

[1]  Martin C. Cooper,et al.  Characterising Tractable Constraints , 1994, Artif. Intell..

[2]  Peter Jeavons,et al.  An Algebraic Characterization of Tractable Constraints , 1995, COCOON.

[3]  Desmond Fearnley-Sander,et al.  Universal Algebra , 1982 .

[4]  Lefteris M. Kirousis.  Fast Parallel Constraint Satisfaction , 1993, ICALP.

[5]  Thomas J. Schaefer,et al.  The complexity of satisfiability problems , 1978, STOC.

[6]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[7]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[8]  Marc Gyssens,et al.  A Unifying Framework for Tractable Constraints , 1995, CP.

[9]  Gary MacGillivray,et al.  On the complexity of colouring by superdigraphs of bipartite graphs , 1992, Discret. Math..

[10]  Peter B. Ladkin,et al.  On binary constraint problems , 1994, JACM.

[11]  Ugo Montanari,et al.  Networks of constraints: Fundamental properties and applications to picture processing , 1974, Inf. Sci..

[12]  George Gratzer,et al.  Universal Algebra , 1979 .

[13]  Simon Kasif,et al.  On the Parallel Complexity of Discrete Relaxation in Constraint Satisfaction Networks , 1990, Artif. Intell..

[14]  I. Rosenberg.  MINIMAL CLONES I: THE FIVE TYPES , 1986 .

[15]  Ágnes Szendrei,et al.  Clones in universal algebra , 1986 .

[16]  D. Geiger.  CLOSED SYSTEMS OF FUNCTIONS AND PREDICATES , 1968 .