Pages that link to "Item:Q991007"
From MaRDI portal
The following pages link to Generalizing constraint satisfaction on trees: hybrid tractability and variable elimination (Q991007):
Displaying 17 items.
- Broken triangles: from value merging to a tractable class of general-arity constraint satisfaction problems (Q253988) (← links)
- Tractability in constraint satisfaction problems: a survey (Q271997) (← links)
- Hybrid tractability of valued constraint problems (Q646503) (← links)
- A polynomial relational class of binary CSP (Q722101) (← links)
- Constraint satisfaction with bounded treewidth revisited (Q847262) (← links)
- A hybrid tractable class for non-binary CSPs (Q903910) (← links)
- Binary constraint satisfaction problems defined by excluded topological minors (Q1633806) (← links)
- The power of propagation: when GAC is enough (Q1701225) (← links)
- On singleton arc consistency for CSPs defined by monotone patterns (Q1739115) (← links)
- Galois connections for patterns: an algebra of labelled graphs (Q2044173) (← links)
- A new branch-and-filter exact algorithm for binary constraint satisfaction problems (Q2077912) (← links)
- On a new extension of BTP for binary CSPs (Q2331096) (← links)
- Characterising the complexity of constraint satisfaction problems defined by 2-constraint forbidden patterns (Q2341755) (← 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)
- The Broken-Triangle Property with Adjoint Values (Q4632206) (← links)
- Hybrid Tractable Classes of Constraint Problems (Q4993597) (← links)
