An Improved AI-Driven Algorithm of Data Flow Optimization on the Normalized Bipolar Planar Free-Oriented Network Graph

Victor Tikhonov, Valery Sitnikov and Serhii Tikhonov

References:

1. “Design & analysis of algorithms. Lecture 11,” 2023, [Online]. Available: https://www.cs.cmu.edu/
2. G. Miller, “15-451: Algorithms. Lecture notes: Introduction to max flow,” 2019, [Online]. Available: https://www.cs.cmu.edu/
3. “Max flow problem introduction,” 2025, [Online]. Available: https://www.geeksforgeeks.org/dsa/max-flow-problem-introduction/.
4. L. Mouatadid, “CSC 373 - Algorithm design, analysis, and complexity,” 2016, [Online]. Available: https://www.cs.toronto.edu/
5. L. R. Ford and D. R. Fulkerson, “Maximal flow through a network,” Canadian Journal of Mathematics, vol. 8, pp. 399–404, 1956.
6. J. Edmonds and R. M. Karp, “Theoretical improvements in algorithmic efficiency for network flow problems,” Journal of the ACM, vol. 19, no. 2, pp. 248–264, 1972.
7. “The Edmonds-Karp algorithm,” 2025, [Online]. Available: https://web.cs.dal.ca/
8. E. A. Dinic, “Algorithm for solution of a problem of maximum flow in a network with power estimation,” Doklady Akademii Nauk SSSR, vol. 194, no. 4, pp. 1277–1280, 1970.
9. A. V. Goldberg and R. E. Tarjan, “A new approach to the maximum flow problem,” in Proc. ACM Symp. Theory of Computing (STOC), 1986, p. 136.
10. A. V. Goldberg, “The binary blocking flow algorithm,” in DIMACS Implementation Challenge, 2008.
11. A. V. Goldberg and S. Rao, “Beyond the flow decomposition barrier,” Journal of the ACM, vol. 45, no. 5, pp. 783–797, 1998.
12. D. Papp, “The Goldberg–Rao algorithm for the maximum flow problem,” 2006, [Online]. Available: https://www.cs.princeton.edu/courses/archive/fall06/cos528/handouts/Goldberg-Rao.pdf.
13. P. Christiano et al., “Electrical flows, Laplacian systems, and faster approximation of maximum flow in undirected graphs,” 2010, [Online]. Available: https://www.semanticscholar.org/reader/af1afe809c106ed2618fc2ae14b696f672fc4bc1.
14. J. Albuquerque et al., “Flexible channel model configuration for scalable 5G-LENA simulations,” in Proc. Int. Conf. ns-3 (ICNS3), 2025, pp. 125–133.
15. V. Arlunno et al., “Digital non-linear equalization for flexible capacity ultradense WDM channels for metro core networking,” Optics Express, vol. 19, no. 26, pp. 270–276, 2011.
16. M. Radjuh, “Osobennosti primenenia principa maximuma Pontriagina,” 2013, [Online]. Available: https://rep.bntu.by/handle/data/5527.
17. J. A. Bondy and U. S. R. Murty, Graph Theory with Applications, 1976, [Online]. Available: https://www.iro.umontreal.ca/
18. D. P. Williamson, Network flow algorithms, Cornell University, 2019, [Online]. Available: https://www.networkflowalgs.com/book.pdf.
19. O. Tykhonova et al., “The max-flow problem statement on the three-pole open network graph,” in Proc. Int. Conf. Advanced Information and Communications Technologies (AICT), 2019, pp. 209–212.
20. O. Tikhonova, “Conveyor-modular method of multimedia flows integration with delay control in packet-based telecommunication networks,” Ph.D. dissertation, Odessa, 2019.
21. R. Haese et al., “Algorithms and complexity for the almost equal maximum flow problem,” 2021, [Online]. Available: https://arxiv.org/pdf/2104.05288.
22. N. Alzaben and D. Engels, “End-to-end routing in SDN controllers using max-flow min-cut route selection algorithm,” in Proc. Int. Conf. Advanced Communication Technology (ICACT), 2021, pp. 461–467.
23. H. Liu et al., “Optimization of a logistics transportation network based on a genetic algorithm,” in Mobile Internet of Things (IoT) Multi-sensor Data Fusion, 2022.
24. O. Cruz-Mejía and A. Letchford, “A survey on exact algorithms for the maximum flow and minimum-cost flow problems,” Networks, vol. 82, pp. 167–176, 2023.
25. J. B. Orlin, “Max flows in O(nm) time, or better,” in Proc. 45th Annu. ACM Symp. Theory of Computing (STOC), Palo Alto, CA, USA, Jun. 2013, pp. 765–774, doi: 10.1145/2488608.2488705.
26. J. B. Orlin and X. Gong, “A fast maximum flow algorithm,” Networks, vol. 77, no. 4, pp. 287–321, 2021, doi: 10.1002/net.22001.
27. K. P. K. Madicharla, “Human-in-the-loop LLMOps: Balancing automation and control,” WJAETS, vol. 15, no. 2, pp. 1992–1999, 2025.
28. J. Turgunov et al., “Human-in-the-loop systems for ethical AI,” 2025, [Online]. Available: https://www.researchgate.net/publication/393802734_HUMAN-IN-THE-LOOP_SYSTEMS_FOR_ETHICAL_AI.