<?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 uniform family of tissue P systems with cell division solving 3-COL in a linear time</style></title><secondary-title><style face="normal" font="default" size="100%">Theoretical Computer Science</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">Membrane computing; Tissue P systems; Cell division; 3-coloring problem</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2008</style></year><pub-dates><date><style  face="normal" font="default" size="100%">09/2008</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://dx.doi.org/10.1016/j.tcs.2008.04.005</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Elsevier</style></publisher><pub-location><style face="normal" font="default" size="100%">Amsterdam (The Netherlands)</style></pub-location><volume><style face="normal" font="default" size="100%">404</style></volume><pages><style face="normal" font="default" size="100%">76-87</style></pages><abstract><style face="normal" font="default" size="100%">Several examples of the efficiency of cell-like P systems regarding the solution of NP-complete problems in polynomial time can be found in the literature(obviously, trading space for time). Recently, different new models of tissue-like P systems have received much 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%">1-2</style></issue><custom1><style face="normal" font="default" size="100%">0.806</style></custom1><custom2><style face="normal" font="default" size="100%">51/84 - Q3</style></custom2></record></records></xml>