In the constraint programming framework, state-of-the-art static and dynamic decomposition techniques are hard to apply to problems with complete initial constraint graphs. For suc...
Let Qn be a hypercube of dimension n, that is, a graph whose vertices are binary n-tuples and two vertices are adjacent iff the corresponding n-tuples differ in exactly one posit...
Maria Axenovich, Heiko Harborth, Arnfried Kemnitz,...
The matching of hierarchical relational structures is of significant interest in computer vision and pattern recognition. We have recently introduced a new solution to this proble...
Let G = (V, E) be a graph. A set S V is a total restrained dominating set if every vertex is adjacent to a vertex in S and every vertex of V - S is adjacent to a vertex in V - S....
Johannes H. Hattingh, Elizabeth Jonck, Ernst J. Jo...
Measuring graph similarity is a key issue in many applications. We propose a new constraint-based modeling language for defining graph similarity measures by means of constraints. ...