A Fast and Simple Algorithm for the Maximum Flow Problem
From MaRDI portal
Recommendations
Cited in
(49)- Dual coordinate step methods for linear network flow problems
- Use of dynamic trees in a network simplex algorithm for the maximum flow problem
- Processor-efficient implementation of a maximum flow algorithm
- Parallel cardinality stacks and an application
- Finding minimum-cost flows by double scaling
- Implementing the Ford-Fulkerson labeling algorithm with fixed-order scanning
- A new Karzanov-type O(n^ 3) max-flow algorithm
- Auction algorithms for network flow problems: A tutorial introduction
- Computational investigations of maximum flow algorithms
- On the maximum capacity augmentation algorithm for the maximum flow problem
- A new saling algorithm for the maximum mean cut problem
- A fast algorithm for the minimax flow problem with 0/1 weights
- Strongly polynomial dual simplex methods for the maximum flow problem
- Minimum cut problem using bases of extended polymatroids
- An incremental algorithm for the maximum flow problem
- An algorithmic study of the maximum flow problem: A comparative statistical analysis
- A maximum flow algorithm using MA ordering.
- Sequential and parallel algorithms for minimum flows.
- A generalization of the scaling max-flow algorithm
- Minimum cuts in parametric networks
- An auction algorithm for the max-flow problem
- Capacity expansion and reliability evaluation on the networks flows with continuous stochastic functional capacity
- Just-in-time scheduling with equal-size jobs
- Faster and more dynamic maximum flow by incremental breadth-first search
- A Scaling Algorithm for the Maximum Node-Capacitated Multiflow Problem
- Algorithms for maximum network flow
- A new approach to the maximum-flow problem
- Improved Time Bounds for the Maximum Flow Problem
- The maximum flow problem: a real-time approach
- NEW MAXIMUM FLOW ALGORITHMS BY MA ORDERMGS AND SCALING
- scientific article; zbMATH DE number 1538873 (Why is no real title available?)
- AO(nm log(U/n)) time maximum flow algorithm
- Wave algorithm for maximum flow in semi-bipartite networks
- scientific article; zbMATH DE number 221929 (Why is no real title available?)
- A comprehensive simplex-like algorithm for network optimization and perturbation analysis
- scientific article; zbMATH DE number 2094562 (Why is no real title available?)
- Recent developments in maximum flow algorithms
- Paralleling of Edmonds-Karp network flow algorithm
- On strongly polynomial variants of the MBU-simplex algorithm for a maximum flow problem with non-zero lower bounds
- A fast maximum flow algorithm
- An augmenting‐flow algorithm for a class of node‐capacitated maximum flow problems
- A survey on exact algorithms for the maximum flow and minimum‐cost flow problems
- More efficient parallel flow algorithms
- Computing a maximum cardinality matching in a bipartite graph in time \(O(n^{1,5}\sqrt{m/\log \,n})\)
- A linear time algorithm for the maximum capacity path problem
- The maximum flow problem: A max-preflow approach
- Quick max-flow algorithm
- Generating pseudo-random permutations and maximum flow algorithms
- Due dates assignment and JIT scheduling with equal-size jobs
This page was built for publication: A Fast and Simple Algorithm for the Maximum Flow Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3033534)
