367 search results - page 13 / 74 » A memetic algorithm for graph coloring |
132
click to vote
EVOW
2004
Springer
15 years 8 months ago
2004
Springer
This paper introduces a new social metaheuristic for the Max-Cut problem applied to a weighted undirected graph. This problem consists in finding a partition of the nodes into two ...
102
click to vote
SIAMDM
2000
15 years 3 months ago
2000
A graph is a split graph if its vertices can be partitioned into a clique and a stable set. A graph is a k-split graph if its vertices can be partitioned into k sets, each of which...
123
click to vote
APPROX
2006
Springer
15 years 7 months ago
2006
Springer
Consider the following problem: For given graphs G and F1, . . . , Fk, find a coloring of the edges of G with k colors such that G does not contain Fi in color i. For example, if e...
126
click to vote
FSTTCS
2000
Springer
15 years 6 months ago
2000
Springer
We investigate a variant of on-line edge-coloring in which there is a fixed number of colors availableandtheaimistocolorasmanyedgesaspossible.Weproveupperandlowerboundsontheperform...