Presentation	2012-03-09 Performance Comparison of Heuristic Algorithms for the Graph Coloring Problem Yuta KOSHIN, Satoshi TAOKA, Toshimasa WATANABE,
PDF Download Page	PDF download Page Link
Abstract(in Japanese)	(See Japanese page)
Abstract(in English)	Graph coloring is an assignment of colors to vertices of a given undirected graph G=(V,E) such that any pair of adjacent vertices receive different colors. The graph coloring problem is a problem of obtaining coloring with the smallest number of colors. The problem is known to be NP-hard, and finding an optimum solution needs long computing time, reguiring heuristic algorithms that give no good solutions, in reasonable computing time. In this paper, we compare performance of well-known heuristic algorithms based on computing experiment.
Keyword(in Japanese)	(See Japanese page)
Keyword(in English)
Paper #	CAS2011-145,SIP2011-165,CS2011-137
Date of Issue

Conference Information
Committee	CAS
Conference Date	2012/3/1(1days)
Place (in Japanese)	(See Japanese page)
Place (in English)
Topics (in Japanese)	(See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To	Circuits and Systems (CAS)
Language	JPN
Title (in Japanese)	(See Japanese page)
Sub Title (in Japanese)	(See Japanese page)
Title (in English)	Performance Comparison of Heuristic Algorithms for the Graph Coloring Problem
Sub Title (in English)
Keyword(1)
1st Author's Name	Yuta KOSHIN
1st Author's Affiliation	Graduate School of Engineering, Hiroshima University()
2nd Author's Name	Satoshi TAOKA
2nd Author's Affiliation	Graduate School of Engineering, Hiroshima University
3rd Author's Name	Toshimasa WATANABE
3rd Author's Affiliation	Graduate School of Engineering, Hiroshima University
Date	2012-03-09
Paper #	CAS2011-145,SIP2011-165,CS2011-137
Volume (vol)	vol.111
Number (no)	465
Page	pp.pp.-
#Pages	6
Date of Issue