367 search results - page 18 / 74 » A memetic algorithm for graph coloring |
CONCURRENCY
2000
13 years 7 months ago
2000
AAIM
2005
Springer
14 years 1 months ago
2005
Springer
Let G be a undirected connected graph. Given a set of g groups each being a subset of V (G), tree routing and coloring is to produce g trees in G and assign a color to each of them...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Let H = (V, E) be a hypergraph. A conflict-free coloring of H is an assignment of colors to V such that in each hyperedge e E there is at least one uniquely-colored vertex. This ...
PDPTA
2003
13 years 9 months ago
2003
In this paper, we study the coloring problem for the undirected binary de Bruijn interconnection network. The coloring scheme is simple and fast. We propose the coloring algorithm...
STOC
2003
ACM
14 years 8 months ago
2003
ACM
