Author:
Fearnley John,Lachish Oded
Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. Amir, E.: Efficient approximation for triangulation of minimum treewidth. In: Proceedings of the 17th Conference in Uncertainty in Artificial Intelligence, pp. 7–15. Morgan Kaufmann Publishers Inc., San Francisco (2001)
2. Arnborg, S., Corneil, D.G., Proskurowski, A.: Complexity of finding embeddings in a k-tree. SIAM Journal on Algebraic and Discrete Methods 8(2), 277–284 (1987)
3. Bodlaender, H.L.: A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM Journal on Computing 25(6), 1305–1317 (1996)
4. Lecture Notes in Computer Science;H.L. Bodlaender,1997
5. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献