Funder
Directorate for Computer and Information Science and Engineering
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference33 articles.
1. Amir, E.: Efficient Approximation for Triangulation of Minimum Treewidth Proceedings of the 17th Conference on Uncertainty in Artificial Intelligence, pp 7–15 (2001)
2. Amir, E.: Approximation algorithms for treewidth. Algorithmica 56(4), 448–479 (2010). doi:
10.1007/s00453-008-9180-4
3. Björklund, A.: Counting Perfect Matchings as Fast as Ryser 23Rd Annual ACM-SIAM Symposium on Discrete Algorithms, pp 914–921 (2012)
4. Björklund, A., Husfeldt, T.: Exact algorithms for exact satisfiability and number of perfect matchings. Algorithmica 52(2), 226–249 (2008)
5. Björklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: Fourier Meets Möbius: Fast Subset Convolution 39Th Annual ACM Symposium on Theory of Computing, pp 67–74 (2007)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献