Terminal pair maximal flow finding using DNA computation

DOI10.1080/02522667.2001.10699505zbMath1049.90114OpenAlexW2028808312MaRDI QIDQ2780801

No author found.

Publication date: 2001

Published in: Journal of Information and 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)

Related Items

A concurrent multi-string matching from multi-text algorithm based on the algorithm of Hamiltonian Path Problem and DNA computation

Cites Work

• Fast data transmission and maximal dynamic flow.
• Unnamed Item
• Unnamed Item
• Unnamed Item