Dinitz’ Algorithm: The Original Version and Even’s Version
Author:
- 1 January 2006
- book chapter
- Published by Springer Nature
- p. 218-240
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- A fast algorithm for constructing a maximum flow through a network1994
- Amortized Computational ComplexitySIAM Journal on Algebraic Discrete Methods, 1985
- A data structure for dynamic treesJournal of Computer and System Sciences, 1983
- An O(n2log n) parallel max-flow algorithmJournal of Algorithms, 1982
- On the theoretical efficiency of various network flow algorithmsTheoretical Computer Science, 1981
- An O(EVIog2V) algorithm for the maximal flow problemJournal of Computer and System Sciences, 1980
- An O(V 5/3 E 2/3) algorithm for the maximal flow problemActa Informatica, 1980
- Network Flow and Testing Graph ConnectivitySIAM Journal on Computing, 1975
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite GraphsSIAM Journal on Computing, 1973
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972