@article {,
	title = {A linear-time tissue P system based solution for the 3-coloring problem},
	journal = {Electronic Notes in Theoretical Computer Science },
	volume = {171},
	year = {2007},
	pages = {81-93},
	publisher = {Elsevier B.V.},
	abstract = {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. },
	keywords = {3-coloring problem, cell division, Membrane computing, Tissue P Systems},
	doi = {10.1016/j.entcs.2007.05.009 },
	url = {http://dx.doi.org/10.1016/j.entcs.2007.05.009},
	author = {Daniel D{\'\i}az-Pernil and Miguel A. Guti{\'e}rrez-Naranjo and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez}
}
