SOLVING MINIMUM INDEPENDENT DOMINATING SET WITH ADELMAN-LIPTON MODEL
Abstract: Adleman showed that deoxyribonucleic acid (DNA) strands could be employed towards calculating solutions to an instance of the Hamiltonian path problem (HPP) [3]. Lipton [5] could solve the Satisfiability problem. In this paper, we use that model for developing a new DNA algorithm to solve minimum independent dominating set problem (MIDSP). In spite of the NP-hardness of minimum independent dominating set problem (MIDSP) our DNA procedures is done in a polynomial time.
Keywords: DNA computing, minimum independent dominating set problem.
How to Cite:
[1] Ahmed A. Sallam, Mohamad Kazem, Abdolah B. Askar, “SOLVING MINIMUM INDEPENDENT DOMINATING SET WITH ADELMAN-LIPTON MODEL,” International Advanced Research Journal in Science, Engineering and Technology (IARJSET), DOI: 10.17148/IARJSET.2016.31210
This work is licensed under a Creative Commons Attribution 4.0 International License.