Solving 3-coloring problem by tissue P systems with cell separation

Tissue P systems are a class of distributed and parallel computing models inspired by intercellular communication and cooperation between neurons. An interesting variant of tissue P systems is known as tissue P systems with cell separation, which is endowed with the ability of generating an exponential workspace in a linear time and in this way getting the possibility to solve computationally hard problems in polynomial time. In this paper, a uniform solution to 3-coloring problem by tissue P systems with cell separation is presented, which is linear in terms of the number of vertices and the number of edges.