Chapter

Principles and Practice of Constraint Programming - CP 2005

Volume 3709 of the series Lecture Notes in Computer Science pp 742-746

Bounds of Graph Characteristics

  • Nicolas BeldiceanuAffiliated withÉcole des Mines de Nantes, LINA FRE CNRS 2729
  • , Thierry PetitAffiliated withÉcole des Mines de Nantes, LINA FRE CNRS 2729
  • , Guillaume RochartAffiliated withBouygues e-lab

* Final gross prices may vary according to local VAT.

Get Access

Abstract

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.