Mohammad Joshan;Jose Hiroki Saito;Emerson Carlos Pedrino
{"title":"Improved Parallel Algorithm for Finding Minimum Cuts in Stochastic Flow Networks","authors":"Mohammad Joshan;Jose Hiroki Saito;Emerson Carlos Pedrino","doi":"10.1109/TLA.2025.10930375","DOIUrl":null,"url":null,"abstract":"This article solves the convergence problem in the Parallel BK algorithm for large-scale flow networks. We introduce a merging method and a pseudo-Boolean representation-based invariance analysis that optimize the algorithm's performance compared to classical approaches such as Ford-Fulkerson, Edmonds-Karp, Push-Relabel, and Kargers Algorithm. Our approach improves energy efficiency, reduces memory usage, and lowers time complexity by leveraging parallelization techniques. We evaluate the performance of these algorithms using Python simulations on various benchmark graphs, ranging from small to large-scale networks. The results show that our method reduces memory consumption by up to 40% and speeds up execution time by 30%, while maintaining high accuracy in finding minimum cuts. This paper demonstrates the algorithm's potential for applications in image segmentation, wireless sensor networks, and network reliability analysis","PeriodicalId":55024,"journal":{"name":"IEEE Latin America Transactions","volume":"23 4","pages":"285-293"},"PeriodicalIF":1.3000,"publicationDate":"2025-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10930375","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Latin America Transactions","FirstCategoryId":"5","ListUrlMain":"https://ieeexplore.ieee.org/document/10930375/","RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0
Abstract
This article solves the convergence problem in the Parallel BK algorithm for large-scale flow networks. We introduce a merging method and a pseudo-Boolean representation-based invariance analysis that optimize the algorithm's performance compared to classical approaches such as Ford-Fulkerson, Edmonds-Karp, Push-Relabel, and Kargers Algorithm. Our approach improves energy efficiency, reduces memory usage, and lowers time complexity by leveraging parallelization techniques. We evaluate the performance of these algorithms using Python simulations on various benchmark graphs, ranging from small to large-scale networks. The results show that our method reduces memory consumption by up to 40% and speeds up execution time by 30%, while maintaining high accuracy in finding minimum cuts. This paper demonstrates the algorithm's potential for applications in image segmentation, wireless sensor networks, and network reliability analysis
期刊介绍:
IEEE Latin America Transactions (IEEE LATAM) is an interdisciplinary journal focused on the dissemination of original and quality research papers / review articles in Spanish and Portuguese of emerging topics in three main areas: Computing, Electric Energy and Electronics. Some of the sub-areas of the journal are, but not limited to: Automatic control, communications, instrumentation, artificial intelligence, power and industrial electronics, fault diagnosis and detection, transportation electrification, internet of things, electrical machines, circuits and systems, biomedicine and biomedical / haptic applications, secure communications, robotics, sensors and actuators, computer networks, smart grids, among others.