Solving several kinds of constrained shortest path problems via DNA computations

Research

Title	Solving several kinds of constrained shortest path problems via DNA computations
Type	JournalPaper
Keywords	constrained shortest path problem, complexity, Adleman-Lipton model, DNA computing.
Year	2015
Journal	Applied mathematics in Engineering, Management and Technology
DOI
Researchers	Mehdi Sohrabi haghighat ، Ardeshir Dolati ، Saeed Safaee

Abstract

In this paper, we consider some procedures for solving several kinds of constrained shortest path problems in the Adleman-Lipton model. These procedures work (in spite of the NP-completeness of the problems)in polynomial time for an edge-weighted graph in Adleman-Lipton mode

Mehdi Sohrabi haghighat

Research

Abstract