.png){kind=icon}
返回
A fast parallel max-flow algorithm
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jpdc.2022.07.003.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A new parallel algorithm for the max-flow problem on directed networks with single-source and single -sink is proposed. The algorithm is based on tree sub-networks and on efficient parallel algorithm to compute max-flows on the tree sub-networks. The latter algorithm is proved to be work-optimal and time-optimal. The parallel implementation of the complete algorithm is more efficient than the best known parallel algorithm for the max-flow problem in terms of time-complexity and the sequential implementation of the algorithm achieves the best known sequential time-complexity, without using any complex data-structures or complex manipulations on the network. (C) 2022 Elsevier Inc. All rights reserved.
Keyword:
Combinatorial optimization
Complexity theory
Discrete optimization
Network flow problems
Parallel algorithms
期刊
IF:
4
论文数:
3.8K
被引数:
4.8K
机构
引用论文
分享收藏Burkholderia cenocepacia Type VI Secretion System Mediates Escape of Type II Secreted Proteins into the Cytoplasm of Infected Macrophages.png)
PLoS ONE
OAAI
PLoS ONEIF0
OAAI分享收藏Tandem orientation of the inter-α-trypsin inhibitor heavy chain H1 and H3 genes串联排列的α-胰蛋白酶抑制剂重链H1和H3基因
PREAI
分享收藏分享收藏
查看更多内容