Author:
Kobayashi Yasuaki,Komuro Keita,Tamaki Hisao
Publisher
Springer International Publishing
Reference19 articles.
1. Arnborg, S., Corneil, D., Proskurowski, A.: Complexity of finding embeddings in a k-tree. SIAM Journal on Matrix Analysis and Applications 8(2), 277–284 (1987)
2. Lecture Notes in Computer Science;E.H. Bachoore,2006
3. van den Broek, J., Bodlaender, H.L.: TreewidthLIB,
http://www.cs.uu.nl/research/projects/treewidthlib/
(accessed February 9 2014)
4. Bodlaender, H.L., Kloks, T.: Efficient and constructive algorithms for the pathwidth and treewidth of graphs. Journal of Algorithms 21, 358–402 (1996)
5. Bodlaender, H.L.: A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM Journal on Computing 25(6), 1305–1317 (1996)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献