1. Amir, E.: Efficient approximation for triangulation of minimum treewidth. In: Proceedings of the 17th Conference on Uncertainty in Artificial Intelligence, UAI 2001, Seattle, Washington, USA, pp. 7–15 (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, 277–284 (1987)
3. Lecture Notes in Computer Science;H.L. Bodlaender,2005
4. Bodlaender, H.L., Koster, A.M.C.A., van den Eijkhof, F., van der Graag, L.C.: Preprocessing for triangulation of probabilistic networks. In: Breese, J., Koller, D. (eds.) Proceedings of the 17th Conference on Uncertainty in Artificial Intelligence, pp. 32–39. Morgan Kaufmann Publishers, San Francisco (2001)
5. Bodlaender, H.L.: A partial k-arboretum of graphs with bounded treewidth. Theoretical Computer Science 209, 1–45 (1998)