most citedMolecular solutions for the Maximum K-colourable Sub graph Problem in Adleman-Lipton model

1 citations · 1 across the 1 of their papers we have counts for

collaborators

1 paper

cs.DS2016★ 1 cited

Molecular solutions for the Maximum K-colourable Sub graph Problem in Adleman-Lipton model

Akbar Moazzam, Babak Dalvand

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…