Author:
Cattell Kevin,Dinneen Michael J.,Fellows Michael R.
Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference25 articles.
1. Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A survey;Arnborg;BIT,1985
2. Linear algorithms for NP-hard problems restricted to partial k-trees;Arnborg;Discrete Appl. Math.,1989
3. Quickly excluding a forest;Bienstock;J. Combin. Theory Ser. B,1991
4. Dynamic programming algorithms on graphs with bounded tree-width;Bodlaender,1988
5. Some classes of graphs with bounded treewidth;Bodlaender;Bull. EATCS,1988
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献