Author:
Chen Zhi-Zhong,Tanahashi Ruka
Publisher
Springer Berlin Heidelberg
Reference8 articles.
1. Lecture Notes in Computer Science;U. Feige,2002
2. Hartvigsen, D.: Extensions of Matching Theory. Ph.D. Thesis, Carnegie-Mellon University (1984)
3. Hochbaum, D.: Approximation Algorithms for NP-Hard Problems. PWS Publishing Company, Boston (1997)
4. Jacobs, D.P., Jamison, R.E.: Complexity of Recognizing Equal Unions in Families of Sets. Journal of Algorithms 37, 495–504 (2000)
5. Kawarabayashi, K., Matsuda, H., Oda, Y., Ota, K.: Path Factors in Cubic Graphs. Journal of Graph Theory 39, 188–193 (2002)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献