362 search results - page 46 / 73 » A Branch-and-Cut algorithm for graph coloring |
TACAS
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Given a theory T and two formulas A and B jointly unsatisfiable in T , a theory interpolant of A and B is a formula I such that (i) its non-theory symbols are shared by ...
WEA
2007
Springer
14 years 2 months ago
2007
Springer
The Balanced Subgraph problem (edge deletion variant) asks for a 2-coloring of a graph that minimizes the inconsistencies with given edge labels. It has applications in social netw...
ICIP
2006
IEEE
14 years 9 months ago
2006
IEEE
This paper describes a technique for generating partition sequences of regions presenting long-term homogeneity in color and motion coherency in terms of affine models. The techni...
CVPR
2003
IEEE
14 years 10 months ago
2003
IEEE
In this paper, we address the stereo matching problem in the presence of reflections and translucency, where image formation can be modeled as the additive superposition of layers...
DAM
2010
13 years 8 months ago
2010
We study P6-free graphs, i.e., graphs that do not contain an induced path on six vertices. Our main result is a new characterization of this graph class: a graph G is P6-free if an...