Pages that link to "Item:Q2341755"
From MaRDI portal
The following pages link to Characterising the complexity of constraint satisfaction problems defined by 2-constraint forbidden patterns (Q2341755):
Displayed 8 items.
- Broken triangles: from value merging to a tractable class of general-arity constraint satisfaction problems (Q253988) (← links)
- Binary constraint satisfaction problems defined by excluded topological minors (Q1633806) (← links)
- On singleton arc consistency for CSPs defined by monotone patterns (Q1739115) (← links)
- Galois connections for patterns: an algebra of labelled graphs (Q2044173) (← links)
- Regular pattern-free coloring (Q2172395) (← links)
- Variable and value elimination in binary constraint satisfaction via forbidden patterns (Q2353394) (← links)
- On Singleton Arc Consistency for CSPs Defined by Monotone Patterns (Q3304113) (← links)
- Hybrid Tractable Classes of Constraint Problems (Q4993597) (← links)