TY - JOUR

T1 - A DNA-based algorithm for arranging weighted cliques

AU - Kim, Ikno

AU - Watada, Junzo

AU - Pedrycz, Witold

PY - 2008/11

Y1 - 2008/11

N2 - 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.

AB - 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.

KW - DNA oligonucleotide

KW - Graph theory

KW - Weighted clique

KW - Weighted graph

UR - http://www.scopus.com/inward/record.url?scp=55249120495&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=55249120495&partnerID=8YFLogxK

U2 - 10.1016/j.simpat.2007.11.003

DO - 10.1016/j.simpat.2007.11.003

M3 - Article

AN - SCOPUS:55249120495

VL - 16

SP - 1561

EP - 1570

JO - Simulation Practice and Theory

JF - Simulation Practice and Theory

SN - 1569-190X

IS - 10

ER -