Genetic Algorithm for Graph Coloring: Exploration of Galinier and Hao's Algorithm

Author： Glass Celia A.   Prügel-Bennett Adam  

Publisher： Springer Publishing Company

ISSN： 1382-6905

Source： Journal of Combinatorial Optimization, Vol.7, Iss.3, 2003-09, pp. : 229-236

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

A New Algorithm for the Graph Coloring by Real-Time PCR

By Iranmanesh Ali   Nejati Razeih  

Journal of Computational and Theoretical Nanoscience, Vol. 10, Iss. 10, 2013-10 ,pp. : 2487-2490

American Scientific Publishers

Access to resources Recommend Favorite

Algorithm for the Cost Edge-Coloring of Trees

By Zhou Xiao   Nishizeki Takao  

Journal of Combinatorial Optimization, Vol. 8, Iss. 1, 2004-03 ,pp. : 97-108

Springer Publishing Company

Access to resources Recommend Favorite

A branch‐and‐price algorithm for the (k,c)‐coloring problem

By  

NETWORKS: AN INTERNATIONAL JOURNAL, Vol. 65, Iss. 4, 2015-07 ,pp. : 353-366

John Wiley & Sons Inc

Access to resources Recommend Favorite

Principal graph stability and the jellyfish algorithm

By Bigelow Stephen   Penneys David  

Mathematische Annalen, Vol. 358, Iss. 1-2, 2014-02 ,pp. : 1-24

Springer Publishing Company

Access to resources Recommend Favorite

An NC Parallel Algorithm for Edge-Coloring Series-Parallel Multigraphs

By Zhou X.   Suzuki H.   Nishizeki T.  

Journal of Algorithms, Vol. 23, Iss. 2, 1997-05 ,pp. : 359-374

Academic Press

Access to resources Recommend Favorite