Sciweavers

145 search results - page 17 / 29
» A new characterization of HH-free graphs
Sort
View
AAAI
2010
14 years 11 months ago
Propagating Conjunctions of AllDifferent Constraints
We study propagation algorithms for the conjunction of two ALLDIFFERENT constraints. Solutions of an ALLDIFFERENT constraint can be seen as perfect matchings on the variable/value...
Christian Bessiere, George Katsirelos, Nina Narody...
DM
2002
186views more  DM 2002»
14 years 9 months ago
Coloring Eulerian triangulations of the projective plane
A simple characterization of the 3, 4, or 5-colorable Eulerian triangulations of the projective plane is given. Key words: Projective plane, triangulation, coloring, Eulerian grap...
Bojan Mohar
69
Voted
DM
1998
91views more  DM 1998»
14 years 9 months ago
On some relations between 2-trees and tree metrics
A tree function (TF) t on a ÿnite set X is a real function on the set of the pairs of elements of X satisfying the four-point condition: for all distinct x; y; z; w ∈ X; t(xy)+...
Bruno Leclerc, Vladimir Makarenkov
SPLC
2000
14 years 11 months ago
Development/maintenance/reuse: software evolution in product lines
The evolution tree model is a two-dimensional model that describes how the versions of the artifacts of a software product evolve. The propagation graph is a data structure that c...
Stephen R. Schach, Amir Tomer
ICPR
2008
IEEE
15 years 11 months ago
Fast and precise kinematic skeleton extraction of 3D dynamic meshes
Shape skeleton extraction is a fundamental preprocessing task in shape-based pattern recognition. This paper presents a new algorithm for fast and precise extraction of kinematic ...
Jean-Philippe Vandeborre, Julien Tierny, Mohamed D...