351 search results - page 6 / 71 » An exact method for graph coloring |
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
This paper presents an algorithm for solving a number of generalized graph coloring problems. Specifically, it gives an agent-based algorithm for the Bandwidth Coloring problem. U...
FSTTCS
2007
Springer
14 years 1 months ago
2007
Springer
We study several cost coloring problems, where we are given a graph and a cost function on the independent sets and are to find a coloring that minimizes the function costs of the...
ISAAC
2009
Springer
14 years 2 months ago
2009
Springer
We provide a certifying algorithm for the problem of deciding whether a P5-free graph is 3-colorable by showing there are exactly six finite graphs that are P5-free and not 3-colo...
DAM
2011
13 years 2 months ago
2011
In this paper, we study the Minimum Sum Set Coloring (MSSC) problem which consists in assigning a set of x(v) positive integers to each vertex v of a graph so that the intersectio...
GC
2007
Springer
13 years 7 months ago
2007
Springer
Let Qn be a hypercube of dimension n, that is, a graph whose vertices are binary n-tuples and two vertices are adjacent iff the corresponding n-tuples differ in exactly one posit...