Publisher
Springer Berlin Heidelberg
Reference18 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. Corneil, and A. Proskurowski. Complexity of finding embeddings in a k-tree. SIAM J. Alg. Disc. Meth., 8:277–284, 1987.
3. S. Arnborg, J. Lagergren, and D. Seese. Problems easy for tree-decomposable graphs (extended abstract). In Proc. 15 th ICALP, pages 38–51, Springer Verlag, Lect. Notes in Comp. Sc. 317, 1988.
4. S. Arnborg and A. Proskurowski. Linear time algorithms for NP-hard problems on graphs embedded in k-trees. TRITA-NA-8404, Dept. of Num. Anal. and Comp. Sci., Royal Institute of Technology, Stockholm, Sweden, 1984.
5. Technical Report;H. L. Bodlaender,1986
Cited by
31 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献