Author:
Gabow Harold N.,Stallmann Matthias
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference27 articles.
1. M. Aigner,Combinatorial Theory, Springer Verlag, Berlin, 1979.
2. A. V. Aho, J. E. Hopcroft andJ. D. Ullman,The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Ma., 1974.
3. D. Coppersmith andS. Winograd, On the asymptotic complexity of matrix multiplication,SIAM J. Comput.,11 (1982), 472–492.
4. J. Edmonds, Paths, trees and flowers,Canadian J. of Math.,17 (1965), 449–467.
5. S. Even andO. Kariv, AnO(n 2.5) algorithm for maximum matching in general graphs,Proc. 16th Annual IEEE Symp. on Foundations of Computer Science, Berkeley, (1975), 100–112.
Cited by
41 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献