Author:
Stoer Mechthild,Wagner Frank
Publisher
Springer Berlin Heidelberg
Reference10 articles.
1. M. L. Fredman and R. E. Tarjan, Fibonacci heaps and their uses in improved network optimization algorithms, Journal of the ACM 34 (1987) 596–615
2. L. R. Ford, D. R. Fulkerson, Maximal flow through a network, Canadian Journal on Mathematics 8 (1956) 399–404
3. A. V. Goldberg and R. E. Tarjan, A new approach to the maximum flow problem, Journal of the ACM 35 (1988) 921–940
4. R. E. Gomory, Multi-terminal network flows, Journal of the SIAM 9 (1961) 551–570
5. X. Hao and J. B. Orlin, A faster algorithm for finding the minimum cut in a graph, 3rd ACM-SIAM Symposium on Discrete Algorithms (1992) 165–174
Cited by
34 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献