Author:
Fichte Johannes K.,Lodha Neha,Szeider Stefan
Publisher
Springer International Publishing
Reference31 articles.
1. Lecture Notes in Computer Science;M Abseher,2017
2. Arnborg, S., Corneil, D.G., Proskurowski, A.: Complexity of finding embeddings in a $$k$$ -tree. SIAM J. Algebraic Discrete Methods 8(2), 277–284 (1987)
3. Bannach, M., Berndt, S., Ehlers, T.: Jdrasil: a modular library for computing tree decompositions. Technical report, Lübeck University, Germany (2016)
4. Berg, J., Järvisalo, M.: SAT-based approaches to treewidth computation: an evaluation. In: Proceedings of the 26th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2014, pp. 328–335. IEEE Computer Society, Limassol, Cyprus, November 2014
5. Bodlaender, H.L., Koster, A.M.C.A.: Combinatorial optimization on graphs of bounded treewidth. Comput. J. 51(3), 255–269 (2008)
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献