Title: Colouring graph by the kernel P system

Authors: Khaira Tazir; Yamina Mohamed Ben Ali

Addresses: Computer Science Department, University of Badji Mokhtar, BP 12, Annaba 23000, Algeria ' Computer Science Department, University of Badji Mokhtar, BP 12, Annaba 23000, Algeria

Abstract: The graph colouring problem is one of the most well-known NP-hard problems. It consists of dividing the set of nodes into classes, so that the nodes of each edge are not in the same class and the number of classes is the minimum corresponding to the number of colour classes. In this paper, we have used the kernel P systems to solve the graph colouring problem. To test the proposed system, three running examples are given using MeCoSim simulator.

Keywords: membrane computing; kernel P systems; graph colouring; simulation.

DOI: 10.1504/IJRIS.2015.072955

International Journal of Reasoning-based Intelligent Systems, 2015 Vol.7 No.3/4, pp.286 - 295

Received: 02 Dec 2014
Accepted: 22 May 2015
Published online: 09 Nov 2015 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article