765 search results - page 80 / 153 » Graph Coloring with Rejection |
COMBINATORICS
1999
13 years 8 months ago
1999
It is proven that for every fixed h, a and b, a graph with n vertices and minimum degree at least h-1 h n, which contains no copy of Kb (the complete graph with b vertices), conta...
ICPR
2008
IEEE
14 years 10 months ago
2008
IEEE
We propose a new solution to the problem of bilayer video segmentation in terms of both, hardware design and algorithmic solution. At the data acquisition stage, we combine color ...
ISCAS
2003
IEEE
14 years 2 months ago
2003
IEEE
Improving testability during the early stages of High-Level Synthesis (HLS) has several benefits, including reduced test hardware overhead, reduced test costs, reduced design iter...
LATIN
2010
Springer
14 years 3 months ago
2010
Springer
Abstract. We define the notion of diversity for families of finite functions, and express the limitations of a simple class of holographic algorithms in terms of limitations on d...
COCO
2007
Springer
14 years 3 months ago
2007
Springer
We study a model of graph related formulae that we call the Constraint-Graph model. A constraintgraph is a labeled multi-graph (a graph where loops and parallel edges are allowed)...