Author:
Korach Ephraim,Penn Michal
Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Reference15 articles.
1. J.A. Bondy and U.S.R. Murty,Graph Theory with Applications (Elsevier, New York, 1976).
2. W.H. Cunningham and A.B. Marsh III, “A primal algorithm for optimum matching,”Mathematical Programming Study 8 (1978) 50–72.
3. J. Edmonds and E.L. Johnson, “Matching a well-solved class of integer linear programs”, in: R. Guy, H. Hanani, N. Sauer and J. Schonheim, eds.,Combinatorial Structures and Their Applications (Gordon and Breach, New York, 1970) pp. 89–92.
4. J. Edmonds and E.L. Johnson, “Matching, Euler tours and the Chinese Postman,”Mathematical Programming 5 (1973) 88–129.
5. S. Even, A. Itai and A. Shamir, “On the complexity of time table and multicommodity flow problems,”SIAM Journal on Computing 5 (1976) 691–703.
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献