Publisher
Springer Berlin Heidelberg
Reference11 articles.
1. Dinic, E.: Algorithm for solution of a problem of maximum flow in networks with power estimation. Soviet Math. Dokl. 11, 1277–1280 (1980)
2. Edmonds, J.: Optimum branchings. J. Res. Nat. Bur. Standards 71B, 233–240 (1967)
3. Fredman, M., Tarjan, R.: Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM 34(3), 596–615 (1987)
4. Gabow, H., Galil, Z., Spencer, T., Tarjan, R.: Efficient algorithms for finding minimum spanning trees in undirected and directed graphs. Combinatorica 6(2), 109–122 (1986)
5. Goldberg, A., Tarjan, R.: Solving minimum-cost flow problems by successive approximation. In: STOC 1987: Proceedings of the nineteenth annual ACM conference on Theory of computing, pp. 7–18 (1987)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献