Solving Minimum Vertex Cover Problem Using DNA Computing

Abstract

Abstract Minimum vertex cover problem is one of classical problem not only in mathematic but also in computer science. However, this problem considered as complex problem since is classify as NP-Hard. This paper proposed new technique based on DNA computing that has good capability to tacked parallel computation. This paper provide new DNA encoding and a set Bio-operation procedure to solve this problem. The result of this technique yield the correct optimum solution with better time complexity ( O (1)) compared the previous algorithms.