Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference17 articles.
1. Babenko, M.: An efficient scaling algorithm for the minimum weight bibranching problem. Lect. Notes Comput. Sci. 5369, 232–245 (2008)
2. Cormen, T., Stein, C., Rivest, R., Leiserson, C.: Introduction to Algorithms. McGraw-Hill Higher Education, New York (2001)
3. Dinic, E.: Algorithm for solution of a problem of maximum flow in networks with power estimation. Sov. Math. Dokl. 11, 1277–1280 (1980)
4. Edmonds, J.: Optimum branchings. J. Res. Natl. Bur. Stand. 71B, 233–240 (1967)
5. Frank, A.: How to make a digraph strongly connected. Combinatorica 1(2), 145–153 (1981)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献