Terminal pair maximal flow finding using DNA computation

DOI10.1080/02522667.2001.10699505MaRDI QIDQ2780801zbMATH OpenOpenAlexFDO

Authors Yi-Shiung Yeh, Jue-Sam Chou

Publication date 2001

Published in Journal of Information \& Optimization Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02522667.2001.10699505

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• A DNA algorithm for the maximal matching problem
• A massively parallel algorithm based on DNA computations for constructing minimal spanning trees
• Solving the maximal matching problem with DNA molecules in Adleman-Lipton model
• DNA computing of bipartite graphs for maximum matching
• Genetic algorithm in DNA computing: a solution to the maximal clique problem

Cites work

• Fast data transmission and maximal dynamic flow.
• scientific article; zbMATH DE number 1241372 (Why is no real title available?)
• scientific article; zbMATH DE number 1330034 (Why is no real title available?)
• scientific article; zbMATH DE number 871944 (Why is no real title available?)

Cited in

(3)

• PROCEDURES FOR COMPUTING THE MAXIMUM WITH DNA
• A massively parallel algorithm based on DNA computations for constructing minimal spanning trees
• A concurrent multi-string matching from multi-text algorithm based on the algorithm of Hamiltonian Path Problem and DNA computation

This page was built for publication: Terminal pair maximal flow finding using DNA computation

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