Funder
National Natural Science Foundation of China
Fundamental Research Funds for the Central Universities
Grant-in-Aid for Scientific Research from the Ministry of Education, Culture, Sports, Science and Technology of Japan
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications
Reference22 articles.
1. Akiba T, Iwata Y (2016) Branch-and-reduce exponential/FPT algorithms in practice: a case study of vertex cover. Theor Comput Sci 609:211–225
2. Bourgeois N, Escoffier B, Paschos VT, van Rooij JMM (2010) Maximum independent set in graphs of average degree at most three in $${O}(1.08537^n)$$ O ( 1 . 08537 n ) . In: TAMC, LNCS 6108, pp 373–384
3. Bourgeois N, Escoffier B, Paschos VT, van Rooij JMM (2012) Fast algorithms for max independent set. Algorithmica 62(1–2):382–415
4. Chen J, Kanj IA, Xia G (2010) Improved upper bounds for vertex cover. Theor Comput Sci 411(40–42):3736–3756
5. Chor B, Fellows M, Juedes DW (2004) Linear kernels in linear time, or how to save k colors in $${O}(n^2)$$ O ( n 2 ) steps. In: WG 2004. LNCS 3353, Springer, pp 257–269
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献