scholarly journals Solving Vertex Cover Problem Using DNA Tile Assembly Model

2013 ◽  
Vol 2013 ◽  
pp. 1-7 ◽  
Author(s):  
Zhihua Chen ◽  
Tao Song ◽  
Yufang Huang ◽  
Xiaolong Shi
Keyword(s):  
Biological Function ◽  
Linear Time ◽  
Vertex Cover ◽  
Assembly Model ◽  
Dna Tiles ◽  
Vertex Cover Problem ◽  
Tile Assembly ◽  
Cover Problem ◽  
Tile Systems ◽  
Assembly Models

DNA tile assembly models are a class of mathematically distributed and parallel biocomputing models in DNA tiles. In previous works, tile assembly models have been proved be Turing-universal; that is, the system can do what Turing machine can do. In this paper, we use tile systems to solve computational hard problem. Mathematically, we construct three tile subsystems, which can be combined together to solve vertex cover problem. As a result, each of the proposed tile subsystems consists ofΘ(1) types of tiles, and the assembly process is executed in a parallel way (like DNA’s biological function in cells); thus the systems can generate the solution of the problem in linear time with respect to the size of the graph.

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

2010 ◽  
Vol 5 (4) ◽  
pp. 540 ◽  
Author(s):  
Chun Lu ◽  
Xingyi Zhang
Keyword(s):  
Cell Separation ◽  
Membrane Computing ◽  
Linear Time ◽  
Vertex Cover ◽  
P Systems ◽  
Computing Model ◽  
Vertex Cover Problem ◽  
Complete Problems ◽  
Np Complete ◽  
Cover Problem

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.

Complexity of the Maximum k-Path Vertex Cover Problem

2020 ◽  
Vol E103.A (10) ◽  
pp. 1193-1201
Author(s):  
Eiji MIYANO ◽  
Toshiki SAITOH ◽  
Ryuhei UEHARA ◽  
Tsuyoshi YAGITA ◽  
Tom C. van der ZANDEN
Keyword(s):  
Vertex Cover ◽  
Vertex Cover Problem ◽  
Cover Problem

Quantum Algorithms of the Vertex Cover Problem on a Quantum Computer

2009 ◽  
Author(s):  
Weng-Long Chang ◽  
Ting-Ting Ren ◽  
Mang Feng ◽  
Shu-Chien Huang ◽  
Lai Chin Lu ◽  
...  
Keyword(s):  
Quantum Computer ◽  
Quantum Algorithms ◽  
Vertex Cover ◽  
Vertex Cover Problem ◽  
Cover Problem
Sign in / Sign up

Export Citation Format

Share Document