Several examples of the efficiency of cell-like P systems regarding the solution of NPcomplete
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.Ministerio de Educación y Ciencia TIN2005-09345-C04-01Junta de Andalucía TIC-58