Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10884641 | Biosystems | 2005 | 5 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Modelling and Simulation
Authors
Dongmei Xiao, Wenxia Li, Zhizhou Zhang, Lin He,