836 search results - page 54 / 168 » Orthogonal Colorings of Graphs |
117
click to vote
EVOW
2009
Springer
15 years 8 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
16 years 1 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...
109
click to vote
DAC
1999
ACM
16 years 2 months 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
15 years 1 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...
125
click to vote
ENDM
2002
15 years 1 months ago
2002
Given a positive integer n and a family F of graphs, let R(n, F) denote the maximum number of colors in an edge-coloring of Kn such that no subgraph of Kn belonging to F has disti...