Article contents
Bounds of graph parameters for global constraints
Published online by Cambridge University Press: 14 February 2007
Abstract
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.
- Type
- Research Article
- Information
- RAIRO - Operations Research , Volume 40 , Issue 4: Journées Francophones de Programmation par Contraintes 2005 , October 2006 , pp. 327 - 353
- Copyright
- © EDP Sciences, 2007
References
- 1
- Cited by