Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference19 articles.
1. Babenko, M.: A faster algorithm for the maximum even factor problem. In: Proc. 21st International Symposium on Algorithms and Computation, pp. 451–462 (2010)
2. Balas, E., Pulleyblank, W.: The perfectly matchable subgraph polytope of an arbitrary graph. Combinatorica 9, 321–337 (1989)
3. Cormen, T., Stein, C., Rivest, R., Leiserson, C.: Introduction to Algorithms. McGraw-Hill Higher Education, Boston (2001)
4. Cunningham, W.H.: Matching, matroids, and extensions. Math. Program. 91(3), 515–542 (2002)
5. Cunningham, W.H., Geelen, J.F.: The optimal path-matching problem. Combinatorica 17, 315–337 (1997)
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献