836 search results - page 89 / 168 » Orthogonal Colorings of Graphs |
127
click to vote
CORR
2010
Springer
14 years 9 months ago
2010
Springer
We study the edge-coloring problem in the message-passing model of distributed computing. This is one of the most fundamental problems in this area. Currently, the best-known dete...
133
click to vote
CPAIOR
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. This paper proposes to use local search inside filtering algorithms of combinatorial structures for which achieving a desired level of consistency is too computationally ...
COMBINATORICS
1999
15 years 1 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...
108
click to vote
ICPR
2008
IEEE
16 years 3 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 ...
107
click to vote
ISCAS
2003
IEEE
15 years 7 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...