Constraint satisfaction problems: Convexity makes AllDifferent constraints tractable
Authors:
- 1 February 2013
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 472, 81-89
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- On problems without polynomial kernelsJournal of Computer and System Sciences, 2009
- Simultaneous matchings: Hardness and approximationJournal of Computer and System Sciences, 2008
- Exploring the complexity boundary between coloring and list-coloringAnnals of Operations Research, 2008
- Fixed-parameter complexity in AI and nonmonotonic reasoningArtificial Intelligence, 2002
- The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group TheorySIAM Journal on Computing, 1998
- Closure properties of constraintsJournal of the ACM, 1997
- Precoloring extension. I. Interval graphsDiscrete Mathematics, 1992
- Tree clustering for constraint networksArtificial Intelligence, 1989
- A sufficient condition for backtrack-bounded searchJournal of the ACM, 1985
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithmsJournal of Computer and System Sciences, 1976