Graph Properties Based Filtering

  • Nicolas Beldiceanu
  • Mats Carlsson
  • Sophie Demassey
  • Thierry Petit
Conference paper

DOI: 10.1007/11889205_7

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4204)
Cite this paper as:
Beldiceanu N., Carlsson M., Demassey S., Petit T. (2006) Graph Properties Based Filtering. In: Benhamou F. (eds) Principles and Practice of Constraint Programming - CP 2006. CP 2006. Lecture Notes in Computer Science, vol 4204. Springer, Berlin, Heidelberg

Abstract

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 graph-based 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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Nicolas Beldiceanu
    • 1
  • Mats Carlsson
    • 2
  • Sophie Demassey
    • 1
  • Thierry Petit
    • 1
  1. 1.École des Mines de Nantes, LINA FRE CNRS 2729NantesFrance
  2. 2.SICSKistaSweden

Personalised recommendations