Author:
Cheriyan J.,Maheshwari S. N.
Publisher
Springer Berlin Heidelberg
Reference8 articles.
1. B. Awerbuch, "Reducing complexities of the distributed max-flow and breadth-first-search algorithms by means of network synchronization", Networks 15(1985), 425–437.
2. B. V. Cherkasky, "Algorithm of construction of maximal flow in networks with complexity of O(V2√E) operations", Mathematical Methods of Solution of Economical Problems 7(1977), 112.
3. E.A. Dinic, "Algorithm for solution of a problem of maximum flow in networks with power estimation", Soviet Math. Doklady 11(1980), 1277–1280.
4. Z. Galil, "An O(V5/3E2/3) algorithm for the maximal flow problem", Acta Informatica 14(1980), 221–242.
5. Z. Galil, "On the theoretical efficiency of various network flow algorithms", Theoretical Computer Science 14(1981) 103–111.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Maximum Flow on Highly Dynamic Graphs;2023 IEEE International Conference on Big Data (BigData);2023-12-15
2. Going with the Flow: Real-Time Max-Flow on Asynchronous Dynamic Graphs;Proceedings of the 6th Joint Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA);2023-06-18
3. Efficient preflow push algorithms;Computers & Operations Research;2008-08
4. A new approach to the maximum-flow problem;Journal of the ACM;1988-10