Bounds of Graph Characteristics

  • Nicolas Beldiceanu
  • Thierry Petit
  • Guillaume Rochart
Conference paper

DOI: 10.1007/11564751_56

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3709)
Cite this paper as:
Beldiceanu N., Petit T., Rochart G. (2005) Bounds of Graph Characteristics. In: van Beek P. (eds) Principles and Practice of Constraint Programming - CP 2005. CP 2005. Lecture Notes in Computer Science, vol 3709. Springer, Berlin, Heidelberg

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.

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