Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

40

Voted

CP
2005
Springer

favoriteEmaildiscussreport

129views Artificial Intelligence» more CP 2005»

Bounds of Graph Characteristics

14 years 4 months ago

Bounds of Graph Characteristics

Download e-lab.bouygues.com

Abstract. This report presents a basic scheme for deriving systematically a ﬁltering 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 report provides bounds for the most common used graph characteristics.

Nicolas Beldiceanu, Thierry Petit, Guillaume Rocha

Real-time Traffic

CP 2005 | Global Constraint | Graph Characteristics | Graph Properties | Programming Languages |

claim paper

Related Content

» Efficient WiFi deployment algorithms based on realistic mobility characteristics

» The Characteristic Polynomial of a Graph is Reconstructible from the Characteristic Polyno...

» Limits and Possibilities of BDDs in State Space Search

» Lower bounds for graph embeddings and combinatorial preconditioners

» On minimally 3connected graphs on a surface

» On Sum Coloring of Graphs with Parallel Genetic Algorithms

» Average consensus over small world networks A probabilistic framework

» Path Layout on Tree Networks Bounds in Different Label Switching Models

» Bounds on the coefficients of the characteristic and minimal polynomials

Post Info
More Details (n/a)

Added	26 Jun 2010
Updated	26 Jun 2010
Type	Conference
Year	2005
Where	CP
Authors	Nicolas Beldiceanu, Thierry Petit, Guillaume Rochart

Comments (0)