Sciweavers

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

143

Voted

EVOW
2004
Springer

148views Artificial Intelligence» more EVOW 2004»

Binary Merge Model Representation of the Graph Colouring Problem

15 years 10 months ago

Binary Merge Model Representation of the Graph Colouring Problem

Download www.vanhemert.co.uk

This paper describes a novel representation and ordering model that, aided by an evolutionary algorithm, is used in solving the graph k-colouring problem. Its strength lies in reducing the number of neighbors that need to be checked for validity. An empirical comparison is made with two other algorithms on a popular selection of problem instances and on a suite of instances in the phase transition. The new representation in combination with a heuristic mutation operator shows promising results.

István Juhos, Attila Tóth, Jano I. v

Real-time Traffic

Artificial Intelligence | EVOW 2004 | Graph K-colouring Problem | Heuristic Mutation Operator | Problem Instances |

claim paper

Related Content

» Heuristic Colour Assignment Strategies for Merge Models in Graph Colouring

» A colour textgraphics separation based on a graph representation

» Improving Graph Colouring Algorithms and Heuristics Using a Novel Representation

» Hierarchical Regionbased Representation For Segmentation And Filtering With Depth In Singl...

» HigherOrder Clique Reduction in Binary Graph Cut

» On the Deterministic Tracking of Moving Objects with a Binary Sensor Network

» Graph Rewriting in Computational Origami

» The Protein Sequence Design Problem in Canonical Model on 2D and 3D Lattices

» MCSOG An LTL Model Checker Based on Symbolic Observation Graphs

Post Info
More Details (n/a)

Added	01 Jul 2010
Updated	01 Jul 2010
Type	Conference
Year	2004
Where	EVOW
Authors	István Juhos, Attila Tóth, Jano I. van Hemert

Comments (0)