Author:
Fomin Fedor V.,Grandoni Fabrizio,Kratsch Dieter
Publisher
Springer Berlin Heidelberg
Reference27 articles.
1. Lecture Notes in Computer Science;M. Alekhnovich,2004
2. Beigel, R., Eppstein, D.: 3-coloring in time O(1.3446
n
): a no-MIS algorithm. In: Proceedings of the 36th IEEE Symposium on Foundations of Computer Science (FOCS 1995), pp. 444–452 (1995)
3. Byskov, J.M.: Enumerating maximal independent sets with applications to graph colouring. Operations Research Letters 32, 547–556 (2004)
4. Dantsin, E., Goerdt, A., Hirsch, E.A., Kannan, R., Kleinberg, J., Papadimitriou, C., Raghavan, P., Schöning, U.: A deterministic (2 − 2/(k + 1))
n
algorithm for k-SAT based on local search. Theoretical Computer Science 289(1), 69–83 (2002)
5. Downey, R.G., Fellows, M.R.: Parameterized complexity. Springer, New York (1999)
Cited by
58 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献