Efficient maximum flow algorithms-Reference-Cited by-同舟云学术

Efficient maximum flow algorithms

Published:2014-08 Issue:8 Volume:57 Page:82-89
ISSN:0001-0782
Container-title:Communications of the ACM
language:en
Short-container-title:Commun. ACM

Author:

Goldberg Andrew V.¹,Tarjan Robert E.²

Affiliation:

1. Microsoft Research Silicon Valley Lab, Mountain View, CA

2. Princeton University, Princeton, NJ

Abstract

Though maximum flow algorithms have a long history, revolutionary progress is still being made.

Publisher

Association for Computing Machinery (ACM)

Subject

General Computer Science

Link

https://dl.acm.org/doi/pdf/10.1145/2628036

Reference31 articles.

1. Ahuja R.K. Magnanti T.L. and Orlin J.B. Network Flows: Theory Algorithms and Applications. Prentice-Hall Inc. Upper Saddle River NJ 1993. Ahuja R.K. Magnanti T.L. and Orlin J.B. Network Flows: Theory Algorithms and Applications . Prentice-Hall Inc. Upper Saddle River NJ 1993.

2. Lecture Notes in Computer Science;Babenko M.A.,2007

3. An O ( n log n ) algorithm for maximum st -flow in a directed planar graph

4. Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time

5. An experimental comparison of min-cut/max- flow algorithms for energy minimization in vision

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

1. An optimal pruned traversal tree-based fast minimum cut solver in dense graph;Information Sciences;2024-01

2. Operational Research: methods and applications;Journal of the Operational Research Society;2023-12-27

3. On inequality constraints in well-known optimisation problems: properties and applications;International Journal of Systems Science: Operations & Logistics;2023-11-15

4. Robust Network Function Computation;IEEE Transactions on Information Theory;2023-11

5. Efficient algorithms for urban vehicular Ad Hoc networks quality based on average network flows;Peer-to-Peer Networking and Applications;2023-10-28