By Topic

Graph Coloring Problem Based on Learning Automata

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Torkestani, J.A. ; Comput. Eng. Dept., Islamic Azad Univ., Arak ; Meybodi, M.R.

The vertex coloring problem is a well-known classical problem in graph theory in which a color is assigned to each vertex of the graph such that no two adjacent vertices have the same color. The minimum vertex coloring problem is known to be an NP-hard problem in an arbitrary graph, and a host of approximation solutions are available. In this paper,four learning automata-based approximation algorithms are proposed for solving the minimum (vertex) coloring problem.It is shown that by a proper choice of the parameters of the algorithm, the probability of approximating the optimal solution is as close to unity as possible. The last proposed algorithm is compared with some well-known coloring algorithms and the results show the efficiency of the proposed algorithm in terms of the color set size and running time of algorithm.

Published in:

Information Management and Engineering, 2009. ICIME '09. International Conference on

Date of Conference:

3-5 April 2009