Graph Invariants as Necessary Conditions for Global Constraints

13 years 10 months ago

Download ftp.sics.se

Abstract. This article presents a database of about 200 graph invariants for deriving systematically necessary conditions from the graph properties based representation of global constraints. This scheme is based on invariants on the graph characteristics used in the description of a global constraint. A SICStus Prolog implementation based on arithmetic and logical constraints as well as on indexicals is available.

Nicolas Beldiceanu, Mats Carlsson, Jean-Xavier Ram

Real-time Traffic

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

claim paper

» Necessary Condition for Path Partitioning Constraints

» Are Spatial and Global Constraints Really Necessary for Segmentation

» Object localization using affine invariant substructure constraints

» Secondorder global optimality conditions for convex composite optimization

» New Classes of Counterexamples to Hendricksons Global Rigidity Conjecture

» Ensuring Structural Constraints in GraphBased Models with Type Inheritance

» Elasticmode algorithms for mathematical programs with equilibrium constraints global conve...

» Iterative Conditional Fitting for Gaussian Ancestral Graph Models

Post Info
More Details (n/a)

Added	26 Jun 2010
Updated	26 Jun 2010
Type	Conference
Year	2005
Where	CP
Authors	Nicolas Beldiceanu, Mats Carlsson, Jean-Xavier Rampon, Charlotte Truchet

Comments (0)

Sciweavers

Graph Invariants as Necessary Conditions for Global Constraints

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

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers