Molecular solutions for the Maximum K-colourable Sub graph Problem in Adleman-Lipton model
نویسندگان
چکیده
منابع مشابه
Molecular solutions for the Maximum K-colourable Sub graph Problem in Adleman-Lipton model
Adleman [1] showed that deoxyribonucleic acid (DNA) strands could be employed towards calculating solutions to an instance of the Hamiltonian path problem (HPP). Lipton [5] also demonstrated that Adlemans techniques could be used to solve the Satisfiability problem. In this paper, we use Adleman-Lipton model for developing a DNA algorithm to solve Maximum k-colourable Sub graph problem. In spit...
متن کاملSolving maximum cut problems in the Adleman-Lipton model.
In this paper, we consider a procedure for solving maximum cut problems in the Adleman-Lipton model. The procedure works in O(n2) steps for maximum cut problems of an undirected graph with n vertices.
متن کاملSolving the Rural Postman problem using the Adleman-Lipton model
In this survey we investigate the application of the Adleman-Lipton model on Rural Postman problem, which given an undirected graph G = (V,E) with positive integer lengths on each of its edges and a subset E ′ ⊆ E, asks whether there exists a hamiltonian circuit that includes each edge of E ′ and has total cost (sum of edge lengths) less or equal to a given integer B (we are allowed to use any ...
متن کاملSolving Minimum k-supplier in Adleman-Lipton model
In this paper, we consider an algorithm for solving the minimum k-supplier problem using the Adleman–Lipton model. The procedure works in O(n) steps for the minimum k-supplier problem of an undirected graph with n vertices, which is an NP-hard combinatorial optimization problem. Keywords-DNA Computing, minimum k-supplier, AdlemanLipton
متن کاملA DNA-based solution to the graph isomorphism problem using Adleman-Lipton model with stickers
Since the experimental demonstration of its feasibility, DNA-based computing has been applied to a number of decision or combinatorial optimization problems. The graph isomorphism problem belongs to the class of NP problems, and has been conjectured intractable, although probably not NP-complete. In this paper, we demonstrate the power of DNA-based computing by showing the graph isomorphism pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IJARCCE
سال: 2016
ISSN: 2278-1021
DOI: 10.17148/ijarcce.2016.5701