An O(|V|3) algorithm for finding maximum flows in networks-Reference-Cited by-同舟云学术

An O(|V|3) algorithm for finding maximum flows in networks

Published:1978-10 Issue:6 Volume:7 Page:277-278
ISSN:0020-0190
Container-title:Information Processing Letters
language:en
Short-container-title:Information Processing Letters

Author:

Malhotra V.M.,Kumar M.Pramodh,Maheshwari S.N.

Publisher

Elsevier BV

Subject

Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science

Reference7 articles.

1. Algorithm of construction of maximal flow in networks with complexity of O(|V|2·|E|12 operations;Cherkasky;Math. Methods of Solution of Econ. Problems,1977

2. Algorithm for solution of a problem of maximum flow in a network with power estimation;Dinic;Soviet Math. Dokl.,1970

3. The max flow algorithm of Dinic and Karzanov: An exposition;Even;MIT Laboratory for Computer Science Technical Report No. MIT/LCS/TM-80,1976

4. Network flow and testing graph connectivity;Even;SIAM J. Comput.,1975

5. Flows in Networks;Ford,1962

Cited by 179 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Traffic Divergence Theory: An Analysis Formalism for Dynamic Networks;IEEE Access;2024

2. Methods for the graph realization problem;Acta Universitatis Sapientiae, Informatica;2023-12-01

3. On Computing a Center Persistence Diagram;Fundamentals of Computation Theory;2023

4. Cutoff stability under distributional constraints with an application to summer internship matching;Mathematical Programming;2022-12-19

5. Length-bounded cuts: Proper interval graphs and structural parameters;Journal of Computer and System Sciences;2022-06