Can a maximum flow be computed in o(nm) time?
Authors:
- 11 December 2005
- book chapter
- Published by Springer Nature
- p. 235-248
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Generating pseudo-random permutations and maximum flow algorithmsInformation Processing Letters, 1990
- A Fast and Simple Algorithm for the Maximum Flow ProblemOperations Research, 1989
- Improved Time Bounds for the Maximum Flow ProblemSIAM Journal on Computing, 1989
- A randomized maximum-flow algorithm1989
- A new approach to the maximum-flow problemJournal of the ACM, 1988
- Self-adjusting binary search treesJournal of the ACM, 1985
- The maximum flow problem is log space complete for PTheoretical Computer Science, 1982