An algorithmic study of the maximum flow problem: A comparative statistical analysis
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3475221 (Why is no real title available?)
- scientific article; zbMATH DE number 524748 (Why is no real title available?)
- scientific article; zbMATH DE number 3436493 (Why is no real title available?)
- scientific article; zbMATH DE number 3251902 (Why is no real title available?)
- scientific article; zbMATH DE number 3349645 (Why is no real title available?)
- scientific article; zbMATH DE number 3366380 (Why is no real title available?)
- A Fast and Simple Algorithm for the Maximum Flow Problem
- An \(O(IVI^3)\) algorithm for finding maximum flows in networks
- Analysis of Preflow Push Algorithms for Maximum Network Flow
- Computational investigations of maximum flow algorithms
- Distance-directed augmenting path algorithms for maximum flow and parametric maximum flow problems
- Implementing Goldberg's max-flow-algorithm ? A computational investigation
- Maximal Flow Through a Network
- 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
Cited in
(5)- scientific article; zbMATH DE number 2163908 (Why is no real title available?)
- A generalization of the scaling max-flow algorithm
- Preemptive benchmarking problem: An approach for official statistics in small areas
- Enhanced instance space analysis for the maximum flow problem
- Performance analysis and comparison of algorithms for measures of network connectivity
This page was built for publication: An algorithmic study of the maximum flow problem: A comparative statistical analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1592633)
