Bounds of Graph Characteristics

Abstract. This report 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 report provides bounds for the most common used graph characteristics.

• Type: Conference
• Year: 2005
• Where: CP
• Authors: Nicolas Beldiceanu, Thierry Petit, Guillaume Rochart
• Keywords: CP 2005, Global Constraint, Graph Characteristics, Graph Properties, Programming Languages