Improved Parallel Algorithm for Finding Minimum Cuts in Stochastic Flow Networks

IF 1.3 4区 工程技术 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS
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
求助全文
约1分钟内获得全文 求助全文
来源期刊
IEEE Latin America Transactions
IEEE Latin America Transactions COMPUTER SCIENCE, INFORMATION SYSTEMS-ENGINEERING, ELECTRICAL & ELECTRONIC
CiteScore
3.50
自引率
7.70%
发文量
192
审稿时长
3-8 weeks
期刊介绍: 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.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信