Volume 40, Number 4, October-December 2006Journées Francophones de Programmation par Contraintes 2005
|Page(s)||327 - 353|
|Published online||14 February 2007|
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
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.