Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. K.A. Abrahamson, M.R. Fellows, Finite Automata, Bounded Treewidth, and Well-Quasiordering, In: Graph Structure Theory, Contemporary Mathematics 147, American Mathematical Society (1993), 539–564.
2. Lect Notes Comput Sci;S. Arnborg,1998
3. H.L. Bodlaender, A Tourist Guide through Treewidth, Acta Cybernetica 11 (1993), 1–21.
4. R.B. Borie, R.G. Parker, C.A. Tovey, Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families, Algorithmica 7 (1992), 555–582.
5. B. Courcelle, Recognizability and Second-Order Definability for Sets of Finite Graphs, technical report I-8634, Universite de Bordeaux, 1987.
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献