Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. Edmonds, J.: Maximum matching and a polyhedron with 0,1-vertices. J. Res. Nat. Bur. Standards 69, 125–130 (1965)
2. Gabow, H.N.: Data structures for weighted matching and nearest common ancestors with linking. In: Proc. ACM-SIAM Symposium on Discrete Algorithms, pp. 434–443 (1990)
3. Hopcroft, J.E., Karp, R.M.: An n5/2 algorithm for maximum matchings in bipartite graphs. SIAM J. Comput. 2, 225–231 (1973)
4. Micali, S., Vazirani, V.: An O( $\sqrt{V}$ E) algorithm for finding maximum matching in general graphs. In: Proc. 21st Annual IEEE Symposium on Foundations of Computer Science (1980)
5. Lecture Notes in Computer Science;D.E. Drake,2003
Cited by
61 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献