Research Journal of Biological Sciences
ISSN: Online 1993-6087ISSN: Print 1815-8846
Abstract
DNA computing is new research areas in biology science and information science separately. The essential characteristic of it is the massive parallel of obtaining and managing information. It has been evidenced that DNA computing can solve those problems which are currently intractable on event the fastest electronic computers. The degree-constrained minimum spanning tree is an important problem in graph theory and it is an NP-complete problem. In this study, we present a algorithm for solving degree-constrained minimum spanning tree problem based on sticker model in DNA computing. The study finds all spanning trees of given graph and minimum spanning tree of given graph.
How to cite this article:
Majid Darehmiraki and Hasan Mishmast Nehi . A Parallel Algorithm for the Degree-Constrained Minimum Spanning Tree Problem by Using DNA Computing.
DOI: https://doi.org/10.36478/rjbsci.2007.658.662
URL: https://www.makhillpublications.co/view-article/1815-8846/rjbsci.2007.658.662