CSP duality and trees of bounded pathwidth

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...

Full description

Saved in:
Bibliographic Details
Published inTheoretical computer science Vol. 411; no. 34; pp. 3188 - 3208
Main Authors Carvalho, Catarina, Dalmau, Víctor, Krokhin, Andrei
Format Journal Article
LanguageEnglish
Published Oxford Elsevier B.V 17.07.2010
Elsevier
Subjects
Algebra
Applied sciences
Approximation
Bounded pathwidth
C (programming language)
Combinatorics
Combinatorics. Ordered structures
Computer science; control theory; systems
Constraint satisfaction problem
Datalog
Exact sciences and technology
Games
Graph theory
Homomorphism duality
Homomorphisms
Mathematics
Miscellaneous
Nonlinearity
Polymorphisms
Sciences and techniques of general use
Searching
Theoretical computing
Trees
Constraint satisfaction problem
Homomorphism duality
Datalog
Polymorphisms
Bounded pathwidth
Hypergraph
Computer theory
Linearity
Tree
Duality
DATALOG
Homomorphism
Polymorphism
Online AccessGet full text

Cover

More Information
Summary: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.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0304-3975
1879-2294
DOI:10.1016/j.tcs.2010.05.016