This article 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. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Beldiceanu, N., Carlsson, M., Demassey, S., & Petit, T. (2006). Graph properties based filtering. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4204 LNCS, pp. 59–74). Springer Verlag. https://doi.org/10.1007/11889205_7
Mendeley helps you to discover research relevant for your work.