Solving Minimum Vertex Cover Problem Using DNA Computing

7Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

This article is free to access.

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.

Cite

CITATION STYLE

APA

Hasudungan, R., Pangestuty, D. M., Latifah, A. J., & Rudiman. (2019). Solving Minimum Vertex Cover Problem Using DNA Computing. In Journal of Physics: Conference Series (Vol. 1361). Institute of Physics Publishing. https://doi.org/10.1088/1742-6596/1361/1/012038

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free