Author:
Xiao Mingyu,Nagamochi Hiroshi
Publisher
Springer Berlin Heidelberg
Reference19 articles.
1. Beigel, R.: Finding maximum independent sets in sparse and general graphs. In: SODA 1999, pp. 856–857. ACM Press, New York (1999)
2. Lecture Notes in Computer Science;N. Bourgeois,2010
3. Lecture Notes in Computer Science;N. Bourgeois,2010
4. Chen, J., Kanj, I.A., Xia, G.: Improved upper bounds for vertex cover. Theoretical Computer Science 411(40-42), 3736–3756 (2010)
5. Lecture Notes in Computer Science;B. Chor,2004
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献