Constraint satisfaction problems: Convexity makes AllDifferent constraints tractable

Michael R. Fellows, Tobias Friedrich, Danny Hermelin, Nina Narodytska, Frances A. Rosamond. Constraint satisfaction problems: Convexity makes AllDifferent constraints tractable. Theoretical Computer Science, 472:81-89, 2013. [doi]

@article{FellowsFHNR13,
  title = {Constraint satisfaction problems: Convexity makes AllDifferent constraints tractable},
  author = {Michael R. Fellows and Tobias Friedrich and Danny Hermelin and Nina Narodytska and Frances A. Rosamond},
  year = {2013},
  doi = {10.1016/j.tcs.2012.11.038},
  url = {http://dx.doi.org/10.1016/j.tcs.2012.11.038},
  researchr = {https://researchr.org/publication/FellowsFHNR13},
  cites = {0},
  citedby = {0},
  journal = {Theoretical Computer Science},
  volume = {472},
  pages = {81-89},
}