Publisher
Springer Berlin Heidelberg
Reference10 articles.
1. K. R. Abrahamson and M. R. Fellows. Finite automata, bounded treewidth and wellquasiordering. In Graph Structure Theory, Contemporary Mathematics vol. 147, pages 539–564. American Mathematical Society, 1993.
2. S. Arnborg, B. Courcelle, A. Proskurowski, and D. Seese. An algebraic theory of graph reduction. In H. Ehrig, H. Kreowski, and G. Rozenberg, editors, Proceedings of the Fourth Workshop on Graph Grammars and Their Applications to Computer Science, pages 70–83. Springer Verlag, Lecture Notes in Computer Science, vol. 532, 1991. To appear in J. ACM.
3. S. Arnborg, J. Lagergren, and D. Seese. Easy problems for tree-decomposable graphs. J. Algorithms, 12:308–340, 1991.
4. H. L. Bodlaender. NC-algorithms for graphs with small treewidth. In J. van Leeuwen, editor, Proc. Workshop on Graph-Theoretic Concepts in Computer Science WG'88, pages 1–10. Springer Verlag, Lecture Notes in Computer Science, vol. 344, 1988.
5. H. L. Bodlaender. A tourist guide through treewidth. Technical Report RUU-CS-92-12, Department of Computer Science, Utrecht University, Utrecht, 1992. To appear in Acta Cybernetica.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献