| Literature DB >> 16236426 |
Dongmei Xiao1, Wenxia Li, Zhizhou Zhang, Lin He.
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.Entities:
Mesh：
Substances：
Year: 2005 PMID： 16236426 DOI： 10.1016/j.biosystems.2005.06.009
Source DB: PubMed Journal: Biosystems ISSN： 0303-2647 Impact factor: 1.973