membrane computing;
tissue P systems;
cell division;
3-coloring problem;
D O I:
10.1016/j.tcs.2008.04.005
中图分类号:
TP301 [理论、方法];
学科分类号:
081202 ;
摘要:
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.
机构:
School of Information Engineering,China University of Geosciences in BeijingSchool of Information Engineering,China University of Geosciences in Beijing
NIU Yunyun
XIAO Jianhua
论文数: 0引用数: 0
h-index: 0
机构:
The Research Center of Logistics,Nankai UniversitySchool of Information Engineering,China University of Geosciences in Beijing
XIAO Jianhua
JIANG Yun
论文数: 0引用数: 0
h-index: 0
机构:
School of Computer Science and Information Engineering,Chongqing Technology and Business UniversitySchool of Information Engineering,China University of Geosciences in Beijing