Author:
Nagamochi Hiroshi,Ono Tadashi,Ibaraki Toshihide
Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Reference9 articles.
1. L. Ford and D. Fulkerson,Flows in Networks (Princeton University Press, 1962).
2. A. Frank, T. Ibaraki and H. Nagamochi, “On sparse subgraphs preserving connectivity properties,”Journal on Graph Theory 17 (1993) 275–281.
3. A. Goldberg and T. Tarjan, “A new approach to the maximum flow problem,”J ACM 35 (1988) 921–940.
4. R. Gomory and T. Hu, “Multi-terminal network flows,”SIAM Journal on Applied Mathematics 9 (1961) 551–570.
5. J. Hao and J.B. Orlin, “A faster algorithm for finding the minimum cut in a graph,”Proc. 3rd ACM-SIAM Symp. on Discrete Algorithms, Orlando, Florida (1992) 165–174.
Cited by
58 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献