Graph Coloring Problem Based on Learning Automata

Authors:
J. Akbari Torkestani;M. R. Meybodi
Affiliations:
-;-
Venue:
ICIME '09 Proceedings of the 2009 International Conference on Information Management and Engineering
Year:
2009

Citing 0
Cited 4

An intelligent backbone formation algorithm for wireless ad hoc networks based on distributed learning automata

Computer Networks: The International Journal of Computer and Telecommunications Networking
An efficient cluster-based CDMA/TDMA scheme for wireless mobile ad-hoc networks: A learning automata approach

Journal of Network and Computer Applications
A Learning Automata-Based Cognitive Radio for Clustered Wireless Ad-Hoc Networks

Journal of Network and Systems Management
Online recognition of human activities and adaptation to habit changes by means of learning automata and fuzzy temporal windows

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.