Publisher
Springer Berlin Heidelberg
Reference7 articles.
1. A.V. Aho, J.E. Hopcroft and J.D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, (1974).
2. H. Cross, "Analysis of Flow in Networks of Conduits of Conductors", Bull. No. 286, Univ. of Illinois Engineering Experimental Station, Urbana, Ill. (1936).
3. J. Edmonds and E.L. Johnson, "Matching, Euler Tours and the Chinese Postman", Math. Programming 5 (1973), 88–124.
4. J. Edmonds, and R.M. Karp, "Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems", J. ACM 19 (1972) 248–264.
5. T. Kameda, "On Maximally Distant Spanning Trees of a Graph", Computing 17 (1976), 115–119.
Cited by
25 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献