Solving maximum cut problems in the Adleman-Lipton model
- PMID: 16236426
- DOI: 10.1016/j.biosystems.2005.06.009
Solving maximum cut problems in the Adleman-Lipton model
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.
Publication types
MeSH terms
Substances
LinkOut - more resources
Full Text Sources