کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
491840 | 720984 | 2008 | 10 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A DNA-based algorithm for arranging weighted cliques
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
A fundamental idea and realization of networks arises in a variety of areas of science and engineering. Their theoretical underpinnings stem from graph theory where numerous fundamental concepts being formulated and solved there have become of immediate interest at the applied side. In this study, our focus is on the weighted maximum clique problem, a highly challenging problem in graph theory. The essence of the problem is to find the nodes with the maximum total of weights in a graph where an edge connects every pair of nodes, meaning every node connects to every other node. We propose an algorithm to find all the weighted cliques as well as the weighted maximum clique in order of size using the framework of DNA computing.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Simulation Modelling Practice and Theory - Volume 16, Issue 10, November 2008, Pages 1561–1570
Journal: Simulation Modelling Practice and Theory - Volume 16, Issue 10, November 2008, Pages 1561–1570
نویسندگان
Ikno Kim, Junzo Watada, Witold Pedrycz,