Author:
Bodlaender Hans L.,Fellows Michael R.,Thilikos Dimitrios M.
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference22 articles.
1. Finite automata, bounded treewidth and well-quasiordering;Abrahamson,1993
2. Linear-time register allocation for a fixed number of registers;Bodlaender,1998
3. Treewidth: Algorithmic techniques and results;Bodlaender,1997
4. A partial k-arboretum of graphs with bounded treewidth;Bodlaender;Theoret. Comput. Sci.,1998
5. A linear time algorithm for finding tree-decompositions of small treewidth;Bodlaender;SIAM J. Comput.,1996
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献