Author:
Bodlaender Hans L.,Grigoriev Alexander,Koster Arie M. C. A.
Publisher
Springer Berlin Heidelberg
Reference30 articles.
1. Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Englewood Cliffs (1993)
2. Amir, E.: Efficient approximations for triangulation of minimum treewidth. In: Proceedings of the 17th Conference on Uncertainty in Artificial Intelligence, pp. 7–15 (2001)
3. Arnborg, S., Corneil, D.G., Proskurowski, A.: Complexity of finding embeddings in a k-tree. SIAM J. Alg. Disc. Meth. 8, 277–284 (1987)
4. Bellenbaum, P., Diestel, R.: Two short proofs concerning tree-decompositions. Combinatorics, Probability, and Computing 11, 541–547 (2002)
5. Bodlaender, H.L.: A linear time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25, 1305–1317 (1996)
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献