Author:
Bourgeois Nicolas,Escoffier Bruno,Paschos Vangelis Th.,van Rooij Johan M. M.
Publisher
Springer Berlin Heidelberg
Reference19 articles.
1. Beigel, R.: Finding maximum independent sets in sparse and general graphs. In: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1999, pp. 856–857 (1999)
2. Lecture Notes in Computer Science;N. Bourgeois,2008
3. Bourgeois, N., Escoffier, B., Paschos, V.Th., van Rooij, J.M.M.: A bottom-up method and fast algorithms for max independent set. In: Proceedings of the 12th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2010 (to appear, 2010)
4. Bourgeois, N., Escoffier, B., Paschos, V.Th., van Rooij, J.M.M.: Fast algorithms for max independent set in graphs of small average degree. arXiv.org; arXiv:0901.1563v1 [cs.DM] (2009)
5. Chen, J., Kanj, I.A., Jia, W.: Vertex cover: Further observations and further improvements. Journal of Algorithms 41(2), 280–301 (2001)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Inclusion/Exclusion Meets Measure and Conquer;Algorithmica;2013-02-27
2. Further Improvement on Maximum Independent Set in Degree-4 Graphs;Combinatorial Optimization and Applications;2011
3. Parameterized Edge Dominating Set in Cubic Graphs;Frontiers in Algorithmics and Algorithmic Aspects in Information and Management;2011
4. Fast Algorithms for max independent set;Algorithmica;2010-10-19
5. Introduction;Exact Exponential Algorithms;2010