765 search results - page 23 / 153 » Graph Coloring with Rejection |
ICANNGA
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. Chromatic number, chromatic sum and chromatic sum number are important graph coloring characteristics. The paper proves that a parallel metaheuristic like the parallel ge...
ESA
2004
Springer
14 years 2 months ago
2004
Springer
We show the first o(n2 ) algorithm for coloring vertices of trianglefree planar graphs using three colors. The time complexity of the algorithm is O(n log n). Our approach can be ...
DAM
2008
13 years 8 months ago
2008
Circular-perfect graphs form a natural superclass of perfect graphs: on the one hand due to their definition by means of a more general coloring concept, on the other hand as an i...
FSTTCS
2007
Springer
14 years 2 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...
ICIP
1999
IEEE
14 years 10 months ago
1999
IEEE
