718 search results - page 42 / 144 » Coloring quasi-line graphs |
IH
1999
Springer
15 years 4 months ago
1999
Springer
Abstract. One way to protect a digital product is to embed an author's signature into the object in the form of minute errors. However, this technique cannot be directly appli...
103
click to vote
EVOW
2009
Springer
15 years 6 months ago
2009
Springer
We present a hybrid evolutionary algorithm for the graph coloring problem (Evocol). Evocol is based on two simple-but-effective ideas. First, we use an enhanced crossover that col...
DCC
2007
IEEE
15 years 11 months ago
2007
IEEE
We consider the distributed computation of a function of random sources with minimal communication. Specifically, given two discrete memoryless sources, X and Y , a receiver wishe...
DAC
1999
ACM
16 years 24 days ago
1999
ACM
Finding the minimum column multiplicity for a bound set of variables is an important problem in Curtis decomposition. To investigate this problem, we compared two graphcoloring pr...
DM
2006
14 years 12 months ago
2006
For an integer r > 0, a conditional (k, r)-coloring of a graph G is a proper k-coloring of the vertices of G such that every vertex of degree at least r in G will be adjacent t...