Author:
Bodlaender H. L.,Deogun J. S.,Jansen K.,Kloks T.,Kratsch D.,Müller H.,Tuza Zs.
Publisher
Springer Berlin Heidelberg
Reference27 articles.
1. H.L. BODLAENDER. A linear time algorithm for finding tree-decompositions of small treewidth. Proceedings of the 25th Annual ACM Symposium on Theory of Computing, ACM Press, New York, 1993, pp. 226–234.
2. H.L. BODLAENDER. A tourist guide through treewidth. Acta Cybernetica 11 (1993), 1–23.
3. H.L. BODLAENDER, J.R. GILBERT, H. HAFSTEINSSON, T. KLOKS. Approximating treewidth, pathwidth and minimum elimination tree height. Proceedings of the 17th International Workshop on Graph-Theoretic Concepts in Computer Science WG'91, Springer-Verlag, Lecture Notes in Computer Science 570, 1992, pp. 1–12. To appear in Journal of Algorithms.
4. J.A. BONDY, U.S.R. MURTY. Graph Theory with Applications. American Elsevier, New York, 1976.
5. A. BRANDSTÄDT. Special graph classes — a survey. Schriftenreihe des FB Mathematik, Universität Duisburg, SM-DU-199, 1991.
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献