Author:
Bodlaender Hans,Kloks Ton
Publisher
Springer Berlin Heidelberg
Reference12 articles.
1. H.L. Bodlaender, Classes of graphs with bounded tree-width, Tech. Rep. RUU-CS-86-22, Department of Computer Science, Utrecht University, Utrecht, 1986.
2. H.L. Bodlaender and T. Kloks, Better algorithms for the pathwidth and treewidth of graphs, Proceedings of the 18th International colloquium on Automata, Languages and Programming, 544–555, Springer Verlag, Lecture Notes in Computer Science, vol. 510 (1991).
3. G. Dirac, On rigid circuit graphs, Abh. Math. Sem. Univ. Hamburg
25, 71–76 (1961).
4. M.R. Fellows and T. Warnow, Personal communication, 1991.
5. D. Fulkerson and O. Gross, Incidence matrices and interval graphs, Pacific J. Math.
15, 835–855 (1965).
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献