Solving the minimum bisection problem using a biologically inspired computational model

DOI10.1016/J.TCS.2009.07.031MaRDI QIDQ847667zbMATH OpenOpenAlexFDO

Authors Xingchang Liu, Xiaofan Yang, Yong Ding, Sheng-Lin Li

Publication date 19 February 2010

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2009.07.031

zbMATH Keywords

Adleman-Lipton-Sticker modelDNA algorithmminimum bisection problem

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• scientific article; zbMATH DE number 1929926
• Biological computation of the solution to the quadratic assignment problem
• Memetic search for the max-bisection problem
• An Efficient Memetic Algorithm for theMax-Bisection Problem
• Computing all efficient solutions of the biobjective minimum spanning tree problem
• Hybrid genetic algorithm within branch-and-cut for the minimum graph bisection problem
• The biobjective minimum cost flow problem

Cites work

• scientific article; zbMATH DE number 4155887 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1241372 (Why is no real title available?)
• scientific article; zbMATH DE number 1738639 (Why is no real title available?)
• scientific article; zbMATH DE number 1929926 (Why is no real title available?)
• scientific article; zbMATH DE number 871944 (Why is no real title available?)
• A polylogarithmic approximation of the minimum bisection
• DNA Computing
• DNA models and algorithms for NP-complete problems
• Strand design for biomolecular computation.

Cited in

(4)

• A biological algorithm to solve the assignment problem based on DNA molecules computation
• Biological computation of the solution to the quadratic assignment problem
• Solving the maximum weighted clique problem based on parallel biological computing model
• Solving two-dimensional cutting stock problem via a DNA computing algorithm

This page was built for publication: Solving the minimum bisection problem using a biologically inspired computational model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q847667)