Author:
Cornuejols Gérard,Pulleyblank William R.
Publisher
Springer Berlin Heidelberg
Reference6 articles.
1. A.V. Aho, J.E. Hopcroft and J.D. Ullman, The design and analysis of computer algorithms (Addison-Wesley, Reading, MA, 1974).
2. G. Cornuéjols and W. Pulleyblank, “A matching problem with side conditions”, Discrete Mathematics 29 (1980) 135–159.
3. J. Edmonds, “Maximum matching and polyhedron with 0–1 vertices”, Journal of Research of the National Bureau of Standards 69b (1965) 125–130.
4. R.M. Karp, “Reducibility among combinatorial problems”, in: R.E. Miller and J.W. Thatcher, eds., Complexity of computer computations (Plenum Press, New York) pp. 85–103.
5. C.H. Papadimitriou, Private communication (1978).
Cited by
27 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献