### 抜粋

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.

元の言語 | English |
---|---|

ページ（範囲） | 1561-1570 |

ページ数 | 10 |

ジャーナル | Simulation Modelling Practice and Theory |

巻 | 16 |

発行部数 | 10 |

DOI | |

出版物ステータス | Published - 2008 11 |

### フィンガープリント

### ASJC Scopus subject areas

- Hardware and Architecture
- Software
- Modelling and Simulation

### これを引用

*Simulation Modelling Practice and Theory*,

*16*(10), 1561-1570. https://doi.org/10.1016/j.simpat.2007.11.003