Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference11 articles.
1. The max cut problem in graphs not contractible to K5;Barahona;Oper. Res. Lett.,1983
2. Maximum matching and a polyhedron with (0, 1) vertices;Edmonds;J. Res. Nat. Bur. Standards,1965
3. Matching: A well solved class of integer linear programs;Edmonds,1970
4. Matching, Euler tours, and the Chinese postman;Edmonds;Math. Programming,1973
Cited by
69 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献