Faster Algorithms for Bound-Consistency of the Sortedness and the Alldifferent Constraint

This publication has 5 references indexed in Scilit:

• Optimal Narrowing of a Block of Sortings in Optimal Time
  Constraints, 2000
• Narrowing a 2n-block of sortings in O (n logn)
  Published by Springer Nature ,1997
• Algorithms for dense graphs and networks on the random access computer
  Algorithmica, 1996
• A linear-time algorithm for a special case of disjoint set union
  Published by Association for Computing Machinery (ACM) ,1983
• Maximum matching in a convex bipartite graph
  Naval Research Logistics Quarterly, 1967