<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="6.x">Drupal-Biblio</source-app><ref-type>13</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Daniel Díaz-Pernil</style></author><author><style face="normal" font="default" size="100%">Miguel A. Gutiérrez-Naranjo</style></author><author><style face="normal" font="default" size="100%">Mario J. Pérez-Jiménez</style></author><author><style face="normal" font="default" size="100%">Agustín Riscos-Núñez</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A linear-time tissue P system based solution for the 3-coloring problem</style></title><secondary-title><style face="normal" font="default" size="100%">Electronic Notes in Theoretical Computer Science </style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">3-coloring problem</style></keyword><keyword><style  face="normal" font="default" size="100%">cell division</style></keyword><keyword><style  face="normal" font="default" size="100%">Membrane computing</style></keyword><keyword><style  face="normal" font="default" size="100%">Tissue P Systems</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2007</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://dx.doi.org/10.1016/j.entcs.2007.05.009</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Elsevier B.V.</style></publisher><volume><style face="normal" font="default" size="100%">171</style></volume><pages><style face="normal" font="default" size="100%">81-93</style></pages><abstract><style face="normal" font="default" size="100%">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. </style></abstract><issue><style face="normal" font="default" size="100%">2</style></issue></record></records></xml>