Have a personal or library account? Click to login
A DNA Algorithm for Calculating the Maximum Flow of a Network Cover

A DNA Algorithm for Calculating the Maximum Flow of a Network

Foundations of Computing and Decision Sciences
Volume 48 (2023): Issue 4 (December 2023)
By: Andrea Sackmann,  Kristelle Brown,  Piotr Formanowicz,  Kevin Morgan,  Noor Kalsheker,  Jon M. Garibaldi and  Jacek Błażewicz  
Open Access
|Dec 2023

Download Article

Download the full article as a PDF file.

DOI: https://doi.org/10.2478/fcds-2023-0021 | Journal eISSN: 2300-3405 | Journal ISSN: 0867-6356
Journal RSS Feed
Language: English
Page range: 483 - 506
Submitted on: Apr 12, 2022
Accepted on: Dec 5, 2023
Published on: Dec 21, 2023
Published by: Poznan University of Technology
In partnership with: Paradigm Publishing Services
Publication frequency: 4 issues per year
Keywords:
DNA computing,
Network problems,
Max-flow,
Min-cut
Related subjects:
Computer sciences,
Artificial intelligence,
Software development

© 2023 Andrea Sackmann, Kristelle Brown, Piotr Formanowicz, Kevin Morgan, Noor Kalsheker, Jon M. Garibaldi, Jacek Błażewicz, published by Poznan University of Technology
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

Previous articleVolume 48 (2023): Issue 4 (December 2023)