مشخصات پژوهش

عنوان	Solving several kinds of constrained shortest path problems via DNA computations
نوع پژوهش	مقاله چاپ‌شده
کلیدواژه‌ها	constrained shortest path problem, complexity, Adleman-Lipton model, DNA computing.
چکیده	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
پژوهشگران	سعید صفایی (نفر سوم)، اردشیر دولتی (نفر دوم)، مهدی سهرابی حقیقت (نفر اول)