Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference13 articles.
1. Perfect matchings of a graph;Anderson;J. Combin. Theory Ser. B,1971
2. Matching, matroids and extensions;Cunningham;Math. Program. Ser. B,2002
3. W.H. Cunningham, J.F. Geelen, The Optimal Path-Matching Problem, Proceedings of 37th Symposium on the Foundations of Computing, IEEE Computer Society Press, Silver Spring, MD, 1996, pp. 78–85.
4. The Optimal Path-Matching Problem;Cunningham;Combinatorica,1997
5. W.H. Cunningham, J.F. Geelen, Combinatorial algorithms for path-matching, manuscript, 2000.
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献