Author:
Bodlaender Hans,Kloks Ton,Kratsch Dieter
Publisher
Springer Berlin Heidelberg
Reference19 articles.
1. S. Arnborg, Efficient algorithms for combinatorial problems on graphs with bounded decomposability-A survey. BIT 25, 2–23, 1985.
2. S. Arnborg, D.G. Cornell and A. Proskurowski, Complexity of finding embeddings in a k-tree, SIAM J. Alg. Disc. Meth. 8, 277–284, 1987.
3. S. Arnborg and A. Proskurowski, Linear time algorithms for NP-hard problems restricted to partial k-trees. Disc. Appl. Math. 23, 11–24, 1989.
4. C. Berge and C. Chvatal, Topics on Perfect Graphs, Annals of Discrete Math. 21, 1984.
5. H.L. Bodlaender, A tourist guide through treewidth, Technical report RUU-CS-92-12, Department of Computer Science, Utrecht University, Utrecht, The Netherlands, 1992. To appear in: Proceedings 7th Int. Meeting of Young Computer Scientists.
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献