684 search results - page 92 / 137 » A characterization of b-perfect graphs |
FUIN
2010
14 years 10 months ago
2010
From an empirical point of view, the hardness of quantified Boolean formulas (QBFs), can be characterized by the (in)ability of current state-of-the-art QBF solvers to decide abo...
MP
2010
14 years 10 months ago
2010
Abstract; Dedicated to Alan J. Hoffman Ball et al. propose a graph model for material compatibility constraints for products such as PCs made from components, where each componen...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
The Dichotomy Conjecture for Constraint Satisfaction Problems has been verified for conservative problems (or, equivalently, for list homomorphism problems) by Andrei Bulatov. An ...
ICPR
2008
IEEE
16 years 1 months ago
2008
IEEE
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 ...
MODELS
2009
Springer
15 years 6 months ago
2009
Springer
Recently, a generic approach for syntax-based user assistance in diagram editors has been proposed that requires the syntax of the visual language to be defined by a graph grammar...