Author:
Björklund Andreas,Husfeldt Thore,Kaski Petteri,Koivisto Mikko
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference18 articles.
1. Beigel, R., Eppstein, D.: 3-coloring in time O(1.3289 n ). J. Algorithms 54, 168–204 (2005)
2. Björklund, A., Husfeldt, T.: Exact algorithms for exact satisfiability and number of perfect matchings. Algorithmica 52, 226–249 (2008)
3. Björklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: Fourier meets Möbius: fast subset convolution. In: Proceedings of the 39th Annual ACM Symposium on Theory of Computing (San Diego, CA, June 11–13, 2007), pp. 67–74. Assoc. Comput. Mach., New York (2007)
4. Björklund, A., Husfeldt, T., Koivisto, M.: Set partitioning via inclusion–exclusion. In: SIAM J. Comput. (2009, to appear). Prelim. versions in Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (Berkeley, CA, Oct. 21–24, 2006), pp. 575–582, 583–590. IEEE Comput. Soc., Los Alamitos (2006)
5. Brooks, R.L.: On colouring the nodes of a network. Proc. Camb. Philos. Soc. 37, 194–197 (1941)
Cited by
27 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献