Author:
Bourgeois Nicolas,Escoffier Bruno,Paschos Vangelis T.,van Rooij Johan M. M.
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference21 articles.
1. Beigel, R.: Finding maximum independent sets in sparse and general graphs. In: Proc. Symposium on Discrete Algorithms, SODA’99, pp. 856–857 (1999)
2. Lecture Notes in Computer Science;N. Bourgeois,2008
3. Lecture Notes in Computer Science;N. Bourgeois,2010
4. Chen, J., Liu, L., Jia, W.: Improvement on vertex cover for low-degree graphs. Networks 35(4), 253–259 (2000)
5. Chen, J., Kanj, I.A., Xia, G.: Labeled search trees and amortized analysis: improved upper bounds for NP-hard problems. Algorithmica 43(4), 245–273 (2005)
Cited by
48 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献