Hamiltonian path problem: The performance comparison deoxyribonucleic acid computing and the branch-and-bound method

Research output

1 Citation (Scopus)

Abstract

In this article different approaches to one of the most popular combinatorial problem - the Hamiltonian path problem - are illustrated and compared between each other. It is shown that it becomes inefficient to use branch-and-bound method, the most popular method which is realized on a computer, from the counted number of vertices because of its exponentially growing complexity, one more algorithm which is based on working with deoxyribonucleic acid (DNA) molecules in a laboratory is analysed. That method works parallel and has linearly growing time consumption. Due to the improvements in the biophysics methods, which are needed for DNA computing, that algorithm became much faster than it was several years ago and it is now possible to add some new stages in DNA computing, which are shown in this paper.

Original languageEnglish
Article number012003
JournalJournal of Physics: Conference Series
Volume1536
Issue number1
DOIs
Publication statusPublished - 21 May 2020
EventInternational Workshop Navigation and Motion Control 2019, NMC 2019 - Ladoga Lake
Duration: 16 Sep 201920 Sep 2019

Scopus subject areas

  • Physics and Astronomy(all)

Fingerprint Dive into the research topics of 'Hamiltonian path problem: The performance comparison deoxyribonucleic acid computing and the branch-and-bound method'. Together they form a unique fingerprint.

Cite this