Login
Register
Reset Password
Publish & Distribute
Publishing Solutions
Distribution Solutions
Subjects
Architecture and Design
Arts
Business and Economics
Chemistry
Classical and Ancient Near Eastern Studies
Computer Sciences
Cultural Studies
Engineering
General Interest
Geosciences
History
Industrial Chemistry
Jewish Studies
Law
Library and Information Science, Book Studies
Life Sciences
Linguistics and Semiotics
Literary Studies
Materials Sciences
Mathematics
Medicine
Music
Pharmacy
Philosophy
Physics
Social Sciences
Sports and Recreation
Theology and Religion
Publications
Journals
Books
Proceedings
Publishers
Blog
Contact
Search
EUR
USD
GBP
English
English
Deutsch
Polski
Español
Français
Italiano
Cart
Home
Journals
Foundations of Computing and Decision Sciences
Volume 48 (2023): Issue 4 (December 2023)
Open Access
A DNA Algorithm for Calculating the Maximum Flow of a Network
Andrea Sackmann
Andrea Sackmann
,
Kristelle Brown
Kristelle Brown
,
Piotr Formanowicz
Piotr Formanowicz
,
Kevin Morgan
Kevin Morgan
,
Noor Kalsheker
Noor Kalsheker
,
Jon M. Garibaldi
Jon M. Garibaldi
and
Jacek Błażewicz
Jacek Błażewicz
| Dec 21, 2023
Foundations of Computing and Decision Sciences
Volume 48 (2023): Issue 4 (December 2023)
About this article
Previous Article
Next Article
Abstract
References
Authors
Articles in this Issue
Preview
PDF
Cite
Share
Published Online:
Dec 21, 2023
Page range:
483 - 506
Received:
Apr 12, 2022
Accepted:
Dec 05, 2023
DOI:
https://doi.org/10.2478/fcds-2023-0021
Keywords
DNA computing
,
Network problems
,
Max-flow
,
Min-cut
© 2023 Andrea Sackmann et al., published by Sciendo
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.