Galois connections for patterns: an algebra of labelled graphs
type: Item
instance of: scholarly article
title: Galois connections for patterns: an algebra of labelled graphs
zbMATH Open document ID: 1467.68176
DOI: 10.1007/978-3-030-72308-8_9
author: David A. Cohen
author: M. C. Cooper
author: P. Jeavons
author: S. Zivny
publication date: 2021-08-04T00:00:00Z
Mathematics Subject Classification ID: 68T30
Mathematics Subject Classification ID: 05C78
Mathematics Subject Classification ID: 06A15
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 7378273
zbMATH Keywords: constraint satisfaction
zbMATH Keywords: tractability
zbMATH Keywords: forbidden patterns
zbMATH Keywords: Galois connection
zbMATH Keywords: lattices
MaRDI profile type: Publication
full work available at URL: 978-3-030-72308-8 9
OpenAlex ID: W3138348664
cites work: Q4993594
cites work: Q5532570
cites work: Classifying the Complexity of Constraints Using Finite Algebras
cites work: A finer reduction of constraint problems to digraphs
cites work: On singleton arc consistency for CSPs defined by monotone patterns
cites work: Tractability in constraint satisfaction problems: a survey
cites work: The Tractability of CSP Classes Defined by Forbidden Patterns
cites work: Binarisation for Valued Constraint Satisfaction Problems
cites work: Binary constraint satisfaction problems defined by excluded topological minors
cites work: Characterising tractable constraints
cites work: Broken triangles: from value merging to a tractable class of general-arity constraint satisfaction problems
cites work: Characterising the complexity of constraint satisfaction problems defined by 2-constraint forbidden patterns
cites work: Generalizing constraint satisfaction on trees: hybrid tractability and variable elimination
cites work: Hybrid tractability of valued constraint problems
cites work: Hybrid Tractable Classes of Constraint Problems
cites work: Q4600768
cites work: Monadic second-order evaluations on tree-decomposable graphs
cites work: Q4530231
cites work: Tree clustering for constraint networks
cites work: The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
cites work: A sufficient condition for backtrack-bounded search
cites work: Domain permutation reduction for constraint satisfaction problems
cites work: The complexity of homomorphism and constraint satisfaction problems seen from the other side
cites work: On the algebraic structure of combinatorial problems
cites work: Closure properties of constraints
cites work: Tractable constraints on ordered domains
cites work: Q5687562
cites work: Q4597893
cites work: Forbidden lifts (NP and CSP for combinatorialists)
cites work: On the Structure of Polynomial Time Reducibility
cites work: A strong Mal'cev condition for locally finite varieties omitting the unary type
cites work: Q5715726
cites work: A Proof of the CSP Dichotomy Conjecture
description: scientific article; zbMATH DE number 7378273