Cheriyan, Joseph; Mehlhorn, Kurt An analysis of the highest-level selection rule in the preflow-push max-flow algorithm. (English) Zbl 1338.68097 Inf. Process. Lett. 69, No. 5, 239-242 (1999). MSC: 68Q25 05C21 90C35 PDFBibTeX XMLCite \textit{J. Cheriyan} and \textit{K. Mehlhorn}, Inf. Process. Lett. 69, No. 5, 239--242 (1999; Zbl 1338.68097) Full Text: DOI Link
Cheriyan, Joseph; Hagerup, Torben; Mehlhorn, Kurt An \(o(n^ 3)\)-time maximum-flow algorithm. (English) Zbl 0864.68019 SIAM J. Comput. 25, No. 6, 1144-1170 (1996). MSC: 68P05 68W10 68W15 68Q25 68R05 90B10 90C35 PDFBibTeX XMLCite \textit{J. Cheriyan} et al., SIAM J. Comput. 25, No. 6, 1144--1170 (1996; Zbl 0864.68019) Full Text: DOI
Cheriyan, J.; Mehlhorn, K. Algorithms for dense graphs and networks on the random access computer. (English) Zbl 0848.68070 Algorithmica 15, No. 6, 521-549 (1996). MSC: 68R10 68M10 PDFBibTeX XMLCite \textit{J. Cheriyan} and \textit{K. Mehlhorn}, Algorithmica 15, No. 6, 521--549 (1996; Zbl 0848.68070) Full Text: DOI
Cheriyan, Joseph; Hagerup, Torben; Mehlhorn, Kurt Can a maximum flow be computed in \(o(nm)\) time? (English) Zbl 0768.90020 Automata, languages and programming, Proc. 17th Int. Colloq., Warwick/GB 1990, Lect. Notes Comput. Sci. 443, 235-248 (1990). MSC: 90B10 68Q25 90C60 65Y05 PDFBibTeX XMLCite \textit{J. Cheriyan} et al., Lect. Notes Comput. Sci. 443, 235--248 (1990; Zbl 0768.90020)