Colouring graph by the kernel P system Online publication date: Mon, 09-Nov-2015
by Khaira Tazir; Yamina Mohamed Ben Ali
International Journal of Reasoning-based Intelligent Systems (IJRIS), Vol. 7, No. 3/4, 2015
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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Reasoning-based Intelligent Systems (IJRIS):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com