Author:
Fomin Fedor V.,Kratsch Dieter
Publisher
Springer Berlin Heidelberg
Reference33 articles.
1. Tarjan, R.E., Trojanowski, A.E.: Finding a maximum independent set. SIAM J. Comput. 6(3), 537–546 (1977)
2. Fomin, F.V., Grandoni, F., Kratsch, D.: Measure and conquer: Domination – a case study. In: Proceedings of the 32nd International Colloquium on Automata, Languages and Programming (ICALP 2005), Lecture Notes in Comput. Sci., vol. 3580, pp. 191–203. Springer (2005)
3. Fomin, F.V., Grandoni, F., Kratsch, D.: Measure and conquer: A simple O(20.288n) independent set algorithm. In: Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2006), pp. 18–25. SIAM (2006)
4. Fomin, F.V., Grandoni, F., Kratsch, D.: A measure & conquer approach for the analysis of exact algorithms. J. ACM 56(5) (2009)
5. Eppstein, D.: Quasiconvex analysis of backtracking algorithms. In: Proceedings of the 15th ACM-SIAM Symposium on Discrete Algorithms (SODA 2004), pp. 781–790. SIAM (2004)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献