On a generalized graph coloring/batch scheduling problem
Texte intégral
Figure
Documents relatifs
E-functions are entire functions with algebraic Taylor coefficients at the ori- gin satisfying certain arithmetic conditions, and solutions of linear differential equations
For some graphs like 1-perfect graphs 2 , for which the chromatic number χ(G) is equal to the size of the maximum cliques γ(G), it is possible to solve the dual problem, the
A bad edge is defined as an edge connecting two vertices that have the same color. The number of bad edges is the fitness score for any chromosome. As
Because this problem is an NP- hard problem there is not a known deterministic efficient (polinomial) method. Non- deterministic methods are in general more efficient but an
Rizzi, Approximating the maximum 3-edge-colorable subgraph problem, Discrete Mathematics 309
Proof Otherwise, we exchange colours along C in order to put the colour δ on the corresponding edge and, by Lemma 2, this is impossible in a
We consider the δ-minimum edge-colouring φ such that the edges of all cycles of F are alternatively coloured α and β except for exactly one edge per cycle which is coloured with δ,
In the continuity of [2], the boundary value problem is formulated in terms of the displacement potential, which is time integral of the velocity potential, and a conformal mapping