Bounds of graph parameters for global constraints
École des Mines de Nantes, LINA FRE CNRS 2729, 44307 Nantes, France; Nicolas.Beldiceanu@emn.fr; Thierry.Petit@emn.fr
2 Bouygues e-lab, 78061 St Quentin en Yvelines, France; Grochart@bouygues.com
Accepted: 20 November 2006
This article presents a basic scheme for deriving systematically a filtering algorithm from the graph properties based representation of global constraints. This scheme is based on the bounds of the graph parameters used in the description of a global constraint. The article provides bounds for the most common used graph parameters.
Mathematics Subject Classification: 68R01
Key words: Global constraint / graph constraint / filtering / bound.
© EDP Sciences, 2007