Solving Vertex Cover Problem by Tissue P Systems with Cell Division

Authors

Tao Song, School of Information Engineering, Wuhan University of Technology, Wuhan, 430070, Hubei, China\\ School of Automation, Huazhong University of Science and Technology, Wuhan 430074, Hubei, China
Hongjiang Zheng
Juanjuan He

Author Country (or Countries)

China

Abstract

Tissue P systems are a class of distributed and parallel computing models investigated in membrane computing, which are inspired from the structure and functioning of communication cells in tissues. Such systems with cell division (corresponding to the mitosis behavior of living cells) can theoretically generate exponential working space in linear time, therefore providing a possible way to solve computational hard problems in feasible time by a space-time trade-off. In this work, we construct a family of tissue P systems with cell division to solve the vertex cover problems, and achieve a linear time solution (with respect to the size of the problems). Furthermore, we prove that the systems are constructed in a uniform manner and work in a confluent way.

Suggested Reviewers

N/A

Digital Object Identifier (DOI)

http://dx.doi.org/10.18576/amis/080141

Recommended Citation

Song, Tao; Zheng, Hongjiang; and He, Juanjuan (2014) "Solving Vertex Cover Problem by Tissue P Systems with Cell Division," Applied Mathematics & Information Sciences: Vol. 08: Iss. 1, Article 41.
DOI: http://dx.doi.org/10.18576/amis/080141
Available at: https://digitalcommons.aaru.edu.jo/amis/vol08/iss1/41