Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Computational Theory and Mathematics,Computer Science Applications,Numerical Analysis,Theoretical Computer Science,Software
Reference12 articles.
1. Berge, C.: Graphs and Hypergraphs. New York: American Elsevier 1973.
2. Chase, S. M.: An implemented graph algorithm for winning Shannon switching games. Comm. ACM15, 253–256 (1972).
3. Edmonds, J.: Minimum partition of a matroid into independent subsets. J. Res. NBS69B, 67–72 (1965).
4. Seminar Report;T. Kameda,1974
5. Kameda, T., Toida, S.: Efficient algorithms for determining an extremal tree of a graph. Proc. 14th Ann. IEEE Symp. Switch. Automata Theory, 12–15 (1973).
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献