Author:
Iwata Satoru,Kobayashi Yusuke
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference13 articles.
1. Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic progressions. J. Symbol. Comput. 9, 251–280 (1990)
2. Edmonds, J.: Edge-disjoint branchings. In: Rustin, R. (ed.) Combinatorial Algorithms, pp. 91–96. Algorithmics Press, New York (1973)
3. Edmonds, J., Giles, R.: A min-max relation for submodular functions on graphs. Ann. Discrete Math. 1, 185–204 (1977)
4. Frank, A.: How to make a digraph strongly connected. Combinatorica 1, 145–153 (1981)
5. Frank, A.: An algorithm for submodular functions on graphs. Ann. Discrete Math. 16, 97–120 (1982)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献