Old Web
English
Sign In
Acemap
>
Paper
>
A Biological Algorithm to Solve the Maximum Complete Subgraph Problem Based on Adleman-Lipton Model
A Biological Algorithm to Solve the Maximum Complete Subgraph Problem Based on Adleman-Lipton Model
2014
Zhaocai Wang
Jian Tan
Lanwei Zhu
Wei Huang
Keywords:
Induced subgraph isomorphism problem
Mathematical optimization
Subgraph isomorphism problem
Combinatorics
Mathematics
Algorithm
Maximum common subgraph isomorphism problem
Correction
Source
Cite
Save
Machine Reading By IdeaReader
0
References
1
Citations
NaN
KQI
[]