跳到主要导航 跳到搜索 跳到主要内容

Solving maximum cut problems in the Adleman-Lipton model

  • Dongmei Xiao
  • , Wenxia Li*
  • , Zhizhou Zhang
  • , Lin He
  • *此作品的通讯作者
  • Shanghai Jiao Tong University

科研成果: 期刊稿件文章同行评审

摘要

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.

源语言英语
页(从-至)203-207
页数5
期刊BioSystems
82
3
DOI
出版状态已出版 - 12月 2005

引用此