An o(n^3 )-Time Maximum-Flow Algorithm
From MaRDI portal
An $o(n^3 )$-Time Maximum-Flow Algorithm
Data structures (68P05) Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Parallel algorithms in computer science (68W10) Distributed algorithms (68W15) Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35)
Recommendations
Cited in
(37)- On the efficiency of maximum-flow algorithms on networks with small integer capacities
- A new Karzanov-type O(n^ 3) max-flow algorithm
- Routing flow through a strongly connected graph
- 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
- The densest subgraph problem with a convex/concave size function
- A maximum flow algorithm using MA ordering.
- Improving time bounds on maximum generalised flow computations by contracting the network
- A generalization of the scaling max-flow algorithm
- Finding densest \(k\)-connected subgraphs
- Capacitated partial inverse maximum spanning tree under the weighted Hamming distance
- Maximum network flow with floating point arithmetic.
- Maximum likelihood analysis of the Ford-Fulkerson method on special graphs
- Optimal allocation in combinatorial auctions with quadratic utility functions
- A new approach to the maximum-flow problem
- scientific article; zbMATH DE number 4104675 (Why is no real title available?)
- Improved Time Bounds for the Maximum Flow Problem
- scientific article; zbMATH DE number 177817 (Why is no real title available?)
- AO(nm log(U/n)) time maximum flow algorithm
- scientific article; zbMATH DE number 1766747 (Why is no real title available?)
- Transfinite Ford-Fulkerson on a finite network
- Probabilistic Analysis of Network Flow Algorithms
- scientific article; zbMATH DE number 221929 (Why is no real title available?)
- scientific article; zbMATH DE number 742960 (Why is no real title available?)
- A Randomized Maximum-Flow Algorithm
- Recent developments in maximum flow algorithms
- Unit Capacity Maxflow in Almost $m^{4/3}$ Time
- scientific article; zbMATH DE number 7204472 (Why is no real title available?)
- Simplifications and speedups of the pseudoflow algorithm
- Max flows in O(nm) time, or better
- Breaking the \(O(n^{2.5})\) deterministic time barrier for undirected unit-capacity maximum flow
- Affinely representable lattices, stable matchings, and choice functions
- A fast maximum flow algorithm
- Minimum shared‐power edge cut
- A survey on exact algorithms for the maximum flow and minimum‐cost flow problems
- Efficient approximation algorithms for scheduling problems with uniform p-batch machines and arbitrary processing set restrictions
- A simple version of Karzanov's blocking flow algorithm
This page was built for publication: An $o(n^3 )$-Time Maximum-Flow Algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5691288)
