An algorithmic study of the maximum flow problem: A comparative statistical analysis
From MaRDI portal
Publication:1592633
DOI10.1007/BF02564832zbMATH Open0966.90067OpenAlexW1551148555MaRDI QIDQ1592633FDOQ1592633
Authors: R. Smith 
Publication date: 2 April 2001
Published in: Top (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02564832
Recommendations
Design of statistical experiments (62K99) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)
Cites Work
- NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
- Maximal Flow Through a Network
- Title not available (Why is that?)
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Title not available (Why is that?)
- Computational investigations of maximum flow algorithms
- Analysis of Preflow Push Algorithms for Maximum Network Flow
- Distance-directed augmenting path algorithms for maximum flow and parametric maximum flow problems
- Title not available (Why is that?)
- An \(O(IVI^3)\) algorithm for finding maximum flows in networks
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Fast and Simple Algorithm for the Maximum Flow Problem
- Implementing Goldberg's max-flow-algorithm ? A computational investigation
Cited In (5)
- Title not available (Why is that?)
- 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
Uses Software
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)
