Skip to content

Opening book details…

Can I read Solving Minimum Vertex Cover Problem Using DNA Computing on EtoBox?

Solving Minimum Vertex Cover Problem Using DNA Computing by Hasudungan, Rofilde; Pangestuty, Dwi M.; Latifah, Asslia J.; Rudiman, is a Physics and Astronomy article available to read on EtoBox.

What is Solving Minimum Vertex Cover Problem Using DNA Computing about?

## 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.

Who reads Solving Minimum Vertex Cover Problem Using DNA Computing?

It is typically read by researchers, students, and practitioners in Physics and Astronomy.

Author
Hasudungan, Rofilde; Pangestuty, Dwi M.; Latifah, Asslia J.; Rudiman,
Publisher
Institute of Physics; IOP Publishing (ISSN 1742-6588)
Published
2019
Language
EN
Field
Physics and Astronomy (Physical Sciences)

More by Hasudungan, Rofilde; Pangestuty, Dwi M.; Latifah, Asslia J.; Rudiman,

Browse all works by Hasudungan, Rofilde; Pangestuty, Dwi M.; Latifah, Asslia J.; Rudiman,