Bounds of Graph Characteristics
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 characteristics used in the description of a global constraint. The article provides bounds for the most common used graph characteristics.
Unable to display preview. Download preview PDF.
- 1.Beldiceanu, N., Carlsson, M., Rampon, J.-X.: Global constraint catalog. Technical Report T2005-06, Swedish Institute of Computer Science (2005)Google Scholar
- 2.Beldiceanu, N., Petit, T., Rochart, G.: Bounds of graph characteristics. Technical Report 05/2/INFO, École des Mines de Nantes (2005)Google Scholar
- 4.Hanák, D.: Implementing global constraints as structured graphs of elementary constraints. Scientific Journal Acta Cybernetica (2003)Google Scholar