Experimental Evaluation of Parametric Max-Flow Algorithms
Authors:
- 1 January 2007
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 256-269
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Experimental Evaluation of Parametric Max-Flow AlgorithmsLecture Notes in Computer Science, 2007
- Balancing Applied to Maximum Network Flow ProblemsLecture Notes in Computer Science, 2006
- Beyond the flow decomposition barrierJournal of the ACM, 1998
- The Pseudoflow Algorithm and the Pseudoflow-Based Simplex for the Maximum Flow Problem1998
- On Implementing the Push—Relabel Method for the Maximum Flow ProblemAlgorithmica, 1997
- A Faster Deterministic Maximum Flow AlgorithmJournal of Algorithms, 1994
- Improved Algorithms for Bipartite Network FlowSIAM Journal on Computing, 1994
- A Fast Parametric Maximum Flow Algorithm and ApplicationsSIAM Journal on Computing, 1989
- A new approach to the maximum-flow problemJournal of the ACM, 1988
- Mathematical Techniques for Efficient Record Segmentation in Large Shared DatabasesJournal of the ACM, 1976