Author:
Kajitani Yoji,Cho Jun Dong,Sarrafzadeh Majid
Publisher
Springer Berlin Heidelberg
Reference30 articles.
1. D. Avis. “Worst Case Bounds for the Euclidean Matching Problem”. In International J. Comput. Math. Appl., 7:251–257, 1981.
2. D. Avis. “A Survey of Heuristics for the Weighted Matching Problem”. In Networks, 13:475–493, 1983.
3. C. Berge. “Two Theorems in Graph Theory”. In Proc. Nat. Acad. Sci. 43, pages 842–844, 1957.
4. B. Bollobás. Extremal Graph Theory. London, NY; Academic Press, page 58, 1978.
5. J. D. Cho, S. Raje, and M. Sarrafzadeh. “A Generalized Multi-Way Maxcut Partitioning”. manuscript, EECS Dept. Northwestern Univ., April 1993.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献