Title of article :
Solving maximum cut problems in the Adleman–Lipton model
Author/Authors :
Dongmei Xiao، نويسنده , , Wenxia Li، نويسنده , , Zhizhou Zhang، نويسنده , , Lin He، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2005
Abstract :
In this paper, we consider a procedure for solving maximum cut problems in the Adleman–Lipton model. The procedure works in O(n2) steps for maximum cut problems of an undirected graph with n vertices.
Keywords :
NP-complete problem , Adleman–Lipton model , Maximum cut problem , DNA computing
Journal title :
BioSystems
Journal title :
BioSystems
