Solving the maximum weighted clique problem based on parallel biological computing model
From MaRDI portal
Publication:1665198
DOI10.1155/2015/275019zbMath1394.90549OpenAlexW1561884104WikidataQ59117815 ScholiaQ59117815MaRDI QIDQ1665198
Zhaocai Wang, Jiangfeng Qin, Zuwen Ji, Lei Li, Dong-Mei Huang
Publication date: 27 August 2018
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2015/275019
Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10)
Cites Work
- Unnamed Item
- Unnamed Item
- A biological algorithm to solve the assignment problem based on DNA molecules computation
- Solving the minimum bisection problem using a biologically inspired computational model
- DNA ternary addition
- A DNA procedure for solving the shortest path problem
- Strand design for biomolecular computation.
- Solving traveling salesman problem in the Adleman-Lipton model
- PROCEDURES FOR LOGIC AND ARITHMETIC OPERATIONS WITH DNA MOLECULES