Graph Properties Based Filtering

Abstract. This report presents a generic filtering scheme, based on the graph description of global constraints. This description is defined by a network of binary constraints and a list of elementary graph properties: each solution of the global constraint corresponds to a subgraph of the initial network, retaining only the satisfied binary constraints, and which fulfills all the graph properties. The graphbased filtering identifies the arcs of the network that belong or not to the solution subgraphs. The objective is to build, besides a catalog of global constraints, also a list of systematic filtering rules based on a limited set of graph properties. We illustrate this principle on some common graph properties and provide computational experiments of the effective filtering on the group constraint.

• Type: Conference
• Year: 2006
• Where: CP
• Authors: Nicolas Beldiceanu, Mats Carlsson, Sophie Demassey, Thierry Petit
• Keywords: Artificial Intelligence, Binary Constraints, CP 2006, Global Constraints, Graph Properties