π
π
The Cartographer
Molecular solutions for the Maximum K-colourable Sub graph Problem in Adleman-Lipton model
October 24, 2016 Β· Declared Dead Β· π arXiv.org
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Akbar Moazzam, Babak Dalvand
arXiv ID
1610.07294
Category
cs.DS: Data Structures & Algorithms
Cross-listed
cs.ET
Citations
2
Venue
arXiv.org
Last Checked
4 months ago
Abstract
Adleman showed that deoxyribonucleic acid DNA strands could be employed towards calculating solutions to an instance of the Hamiltonian path problem . Lipton also demonstrated that Adleman 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 spite of the NP-hardness of Maximum k-colourable Sub graph problem our DNA procedures is done in a polynomial time.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β Data Structures & Algorithms
R.I.P.
π»
Ghosted
Route Planning in Transportation Networks
R.I.P.
π»
Ghosted
Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration
R.I.P.
π»
Ghosted
Hierarchical Clustering: Objective Functions and Algorithms
R.I.P.
π»
Ghosted
Graph Isomorphism in Quasipolynomial Time
π
π
The Cartographer
Simulation optimization: A review of algorithms and applications
Died the same way β π» Ghosted
R.I.P.
π»
Ghosted
Federated Learning: Strategies for Improving Communication Efficiency
R.I.P.
π»
Ghosted
In-Datacenter Performance Analysis of a Tensor Processing Unit
R.I.P.
π»
Ghosted
Deep Convolutional Neural Networks for Computer-Aided Detection: CNN Architectures, Dataset Characteristics and Transfer Learning
R.I.P.
π»
Ghosted