Bounds of graph characteristics

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3709 LNCS, Issue , 2005, Pages 742-746

  Beldiceanu, Nicolas ^a   Petit, Thierry ^a   Rochart, Guillaume ^b  

^a ECOLE DES MINES DE NANTES   (France)

^b Bouygues Telecom   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMIC LANGUAGES; BOUNDARY CONDITIONS; COMPUTER PROGRAMMING; CONSTRAINT THEORY; SECURITY OF DATA;

FILTERING ALGORITHM; GLOBAL CONSTRAINTS; GRAPH CHARACTERISTICS;

GRAPH THEORY;

EID: 33646176615     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11564751_56     Document Type: Conference Paper

References (4)

1. N. Beldiceanu, M. Carlsson, and J.-X. Rampon. Global constraint catalog. Technical Report T2005-06, Swedish Institute of Computer Science, 2005.
2. N. Beldiceanu, T. Petit, and G. Rochart. Bounds of graph characteristics. Technical Report 05/2/INFO, École des Mines de Nantes, 2005.
3. C. Bessière, E. Hebrard, B. Hnich, Z. Kiziltan, and T. Walsh. Filtering algorithms for the nvalue constraint. In CP-AI-OR 2005, volume 3524 of LNCS, pages 79-93. Springer-Verlag, 2005.
4. D. Hanák. Implementing global constraints as structured graphs of elementary constraints. Scientific Journal Acta Cybernetica, 2003.