Journal
THEORETICAL COMPUTER SCIENCE
Volume 404, Issue 1-2, Pages 76-87Publisher
ELSEVIER
DOI: 10.1016/j.tcs.2008.04.005
Keywords
membrane computing; tissue P systems; cell division; 3-coloring problem
Categories
Ask authors/readers for more resources
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. (C) 2008 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available