A Linear–time Tissue P System Based Solution for the 3–coloring Problem

In the literature, several examples of the efficiency of cell-like P systems regarding the solution of NP-complete problems in polynomial time can be found (obviously, trading space for time). Recently, different new models of tissue-like P systems have received important attention from the scientif...

Full description

Saved in:
Bibliographic Details
Published inElectronic notes in theoretical computer science Vol. 171; no. 2; pp. 81 - 93
Main Authors Díaz-Pernil, Daniel, Gutiérrez-Naranjo, Miguel A., Pérez-Jiménez, Mario J., Riscos-Núñez, Agustín
Format Journal Article
LanguageEnglish
Published Elsevier B.V 05.07.2007
Subjects
3-coloring problem
cell division
Membrane Computing
Tissue P Systems
Membrane Computing
cell division
3-coloring problem
Tissue P Systems
Online AccessGet full text

Cover

More Information
Summary:In the literature, several examples of the efficiency of cell-like P systems regarding the solution of NP-complete problems in polynomial time can be found (obviously, trading space for time). Recently, different new models of tissue-like P systems have received important attention from the scientific community. In this paper we present a linear-time solution to an NP-complete problem from graph theory, the 3-coloring problem, and we discuss the suitability of tissue-like P systems as a framework to address the efficient solution to intractable problems.
ISSN:1571-0661
1571-0661
DOI:10.1016/j.entcs.2007.05.009