An $o(n^3 )$-Time Maximum-Flow Algorithm
From MaRDI portal
Publication:5691288
DOI10.1137/S0097539791278376zbMath0864.68019MaRDI QIDQ5691288
Kurt Mehlhorn, Torben Hagerup, Joseph Cheriyan
Publication date: 9 June 1997
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Deterministic network models in operations research (90B10) Parallel algorithms in computer science (68W10) Data structures (68P05) Distributed algorithms (68W15)
Related Items (12)
A generalization of the scaling max-flow algorithm ⋮ Recent developments in maximum flow algorithms ⋮ Minimum shared‐power edge cut ⋮ A survey on exact algorithms for the maximum flow and minimum‐cost flow problems ⋮ Partial inverse maximum spanning tree in which weight can only be decreased under \(l_p\)-norm ⋮ A bottleneck detection algorithm for complex product assembly line based on maximum operation capacity ⋮ Finding densest \(k\)-connected subgraphs ⋮ Optimal Allocation in Combinatorial Auctions with Quadratic Utility Functions ⋮ AO(nm log(U/n)) time maximum flow algorithm ⋮ Capacitated partial inverse maximum spanning tree under the weighted Hamming distance ⋮ The densest subgraph problem with a convex/concave size function ⋮ Affinely representable lattices, stable matchings, and choice functions
This page was built for publication: An $o(n^3 )$-Time Maximum-Flow Algorithm
