Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

8

ICANNGA
2007
Springer

favoriteEmaildiscussreport

141views Algorithms» more ICANNGA 2007»

On Sum Coloring of Graphs with Parallel Genetic Algorithms

13 years 10 months ago

On Sum Coloring of Graphs with Parallel Genetic Algorithms

Download riad.usk.pk.edu.pl

Abstract. Chromatic number, chromatic sum and chromatic sum number are important graph coloring characteristics. The paper proves that a parallel metaheuristic like the parallel genetic algorithm (PGA) can be eﬃciently used for computing approximate sum colorings and ﬁnding upper bounds for chromatic sums and chromatic sum numbers for hard– to–color graphs. Suboptimal sum coloring with PGA gives usually much closer upper bounds then theoretical formulas known from the literature.

Zbigniew Kokosinski, Krzysztof Kwarciany

Real-time Traffic

Chromatic Sum | Chromatic Sum Numbers | ICANNGA 2007 | Sum Coloring |

claim paper

Related Content

» Minimum sum edge colorings of multicycles

» Minimum sum set coloring of trees and line graphs of trees

» A New Hybrid Genetic Algorithm for the Robust Graph Coloring Problem

» Sum Coloring of Bipartite Graphs with Bounded Degree

» Evaluation of Neural and Genetic Algorithms for Synthesizing Parallel Storage Schemes

» Fast Heuristics for the Edge Coloring of Large Graphs

» A Parallel Distance2 Graph Coloring Algorithm for Distributed Memory Computers

» Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs

» Robust cost colorings

Post Info
More Details (n/a)

Added	08 Jun 2010
Updated	08 Jun 2010
Type	Conference
Year	2007
Where	ICANNGA
Authors	Zbigniew Kokosinski, Krzysztof Kwarciany

Comments (0)