A generalization of the scaling max-flow algorithm
From MaRDI portal
Publication:1885993
DOI10.1016/S0305-0548(03)00171-0zbMath1068.68172MaRDI QIDQ1885993
Sergio Alonso, Antonio Sedeño-Noda, Carlos González-Martín
Publication date: 12 November 2004
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0305-0548(03)00171-0
68W40: Analysis of algorithms
68W05: Nonnumerical algorithms
90B10: Deterministic network models in operations research
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Scaling algorithms for network problems
- An \(O(IVI^3)\) algorithm for finding maximum flows in networks
- Computational investigations of maximum flow algorithms
- On implementing the push-relabel method for the maximum flow problem
- An algorithmic study of the maximum flow problem: A comparative statistical analysis
- A data structure for dynamic trees
- A Fast and Simple Algorithm for the Maximum Flow Problem
- Analysis of Preflow Push Algorithms for Maximum Network Flow
- Beyond the flow decomposition barrier
- Maximal Flow Through a Network
- Improved Time Bounds for the Maximum Flow Problem
- NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Implementing Goldberg's max-flow-algorithm ? A computational investigation
- A Faster Deterministic Maximum Flow Algorithm
- AO(nm log(U/n)) time maximum flow algorithm
- Distance-directed augmenting path algorithms for maximum flow and parametric maximum flow problems
- An $o(n^3 )$-Time Maximum-Flow Algorithm
