CSP duality and trees of bounded pathwidth

Authors:
Catarina Carvalho;Víctor Dalmau;Andrei Krokhin
Affiliations:
Centre for Algebra, University of Lisbon, 1649-003 Lisbon, Portugal;Department of Technology, University Pompeu Fabra, Barcelona, 08018, Spain;School of Engineering and Computing Sciences, Durham University, Durham, DH1 3LE, UK
Venue:
Theoretical Computer Science
Year:
2010

Citing 22
Cited 2

Searching and pebbling

Theoretical Computer Science
The complexity of searching a graph

Journal of the ACM (JACM)
Expressiveness of restricted recursive queries

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Chromatically optimal rigid graphs

Journal of Combinatorial Theory Series B
The vertex separation number of a graph equals its path-width

Information Processing Letters
Recontamination does not help to search a graph

Journal of the ACM (JACM)
Graph searching and a min-max theorem for tree-width

Journal of Combinatorial Theory Series B
The vertex separation and search number of a graph

Information and Computation
Algebraic properties and dismantlability of finite posets

Discrete Mathematics
The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory

SIAM Journal on Computing
Tractable conservative Constraint Satisfaction Problems

LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
Robbers, marshals, and guards: game theoretic and logical characterizations of hypertree width

Journal of Computer and System Sciences - Special issu on PODS 2001
The Complexity of the Extendibility Problem for Finite Posets

SIAM Journal on Discrete Mathematics
Classifying the Complexity of Constraints Using Finite Algebras

SIAM Journal on Computing
A dichotomy theorem for constraint satisfaction problems on a 3-element set

Journal of the ACM (JACM)
Symmetric Datalog and Constraint Satisfaction Problems in Logspace

LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
Majority constraints have bounded pathwidth duality

European Journal of Combinatorics
An annotated bibliography on guaranteed graph searching

Theoretical Computer Science
Caterpillar Duality for Constraint Satisfaction Problems

LICS '08 Proceedings of the 2008 23rd Annual IEEE Symposium on Logic in Computer Science
Marshals, monotone marshals, and hypertree-width

Journal of Graph Theory
Universal algebra and hardness results for constraint satisfaction problems

Theoretical Computer Science
Constraint Satisfaction Problems of Bounded Width

FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science

Tree dualities for constraint satisfaction

CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Robust Satisfiability for CSPs: Hardness and Algorithmic Results

ACM Transactions on Computation Theory (TOCT)

Quantified Score

Hi-index	5.23

Visualization

Abstract

We study non-uniform constraint satisfaction problems definable in monadic Datalog stratified by the use of non-linearity. We show how such problems can be described in terms of homomorphism dualities involving trees of bounded pathwidth and in algebraic terms. For this, we introduce a new parameter for trees that closely approximates pathwidth and can be characterised via a hypergraph searching game.