An O(n2log n) parallel max-flow algorithm
From MaRDI portal
Publication:3942729
DOI10.1016/0196-6774(82)90013-XzbMath0483.90044WikidataQ56813860 ScholiaQ56813860MaRDI QIDQ3942729
Publication date: 1982
Published in: Journal of Algorithms (Search for Journal in Brave)
90C35: Programming involving graphs or networks
68Q25: Analysis of algorithms and problem complexity
65K05: Numerical mathematical programming methods
90B10: Deterministic network models in operations research
Related Items
Trade-offs between communication throughput and parallel time, Processor-efficient implementation of a maximum flow algorithm, Worst case behavior of the Dinic algorithm, Expected parallel time and sequential space complexity of graph and digraph problems, A new Karzanov-type \(O(n^ 3)\) max-flow algorithm, A heuristic for blocking flow algorithms, Characterizing multiterminal flow networks and computing flows in networks of small treewidth, Finding maximum matching for bipartite graphs in parallel, An auction algorithm for the max-flow problem