ARTICLE
TITLE

Solving Vertex Cover Problem by Means of Tissue P Systems with Cell Separation

SUMMARY

Tissue P systems is a computing model in the framework of membrane computing inspired from intercellular communication and cooperation between neurons. Many different variants of this model have been proposed. One of the most important models is known as tissue P systems with cell separation. This model has the ability of generating an exponential amount of workspace in linear time, thus it allows us to design cellular solutions to NP-complete problems in polynomial time. In this paper, we present a solution to the Vertex Cover problem via a family of such devices. This is the first solution to this problem in the framework of tissue P systems with cell separation.

 Articles related

?. F. Povkhan    

Context. The general problem of constructing logical trees of recognition (classification) in the theory of artificial intelligence is considered in this paper. The object of this study is the concept of the classification tree (a logical and an algorith... see more


I. F. Povhan    

Context. A general problem of constructing logical recognition/classification trees has been analyzed. Logical classification trees are the object of the present study. The subject of the study are the relevant methods and algorithms of logical classific... see more


M. Ilyashenko    

The paper presents graph-analytical approach for organizations resources distribution. It based on graph-subgraph isomorphismalgorithm for weighted and labeled graphs and can be considered as development of graph-subgraph isomorphism algorithm for weight... see more