Bounds of Graph Characteristics

  • Nicolas Beldiceanu
  • Thierry Petit
  • Guillaume Rochart
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3709)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Beldiceanu, N., Carlsson, M., Rampon, J.-X.: Global constraint catalog. Technical Report T2005-06, Swedish Institute of Computer Science (2005)Google Scholar
  2. 2.
    Beldiceanu, N., Petit, T., Rochart, G.: Bounds of graph characteristics. Technical Report 05/2/INFO, École des Mines de Nantes (2005)Google Scholar
  3. 3.
    Bessière, C., Hebrard, E., Hnich, B., Kızıltan, Z., Walsh, T.: Filtering algorithms for the nValue constraint. In: Barták, R., Milano, M. (eds.) CPAIOR 2005. LNCS, vol. 3524, pp. 79–93. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  4. 4.
    Hanák, D.: Implementing global constraints as structured graphs of elementary constraints. Scientific Journal Acta Cybernetica (2003)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Nicolas Beldiceanu
    • 1
  • Thierry Petit
    • 1
  • Guillaume Rochart
    • 2
  1. 1.École des Mines de NantesLINA FRE CNRS 2729NantesFrance
  2. 2.Bouygues e-labSt. Quentin en YvelinesFrance

Personalised recommendations