Author:
Cesati Marco,Di Ianni Miriam
Publisher
Springer Berlin Heidelberg
Reference10 articles.
1. Stefan Arnborg, Jens Lagergren, and Detlef Seese. Easy problems for treedecomposable graphs. Journal of Algorithms, 12, 308–340, 1991.
2. Hans L. Bodlaender. A partial k-arboretum of graphs with bounded treewidth. Technical Report, Department of Computer Science, Utrecht University, 1995.
3. Hans L. Bodlaender, Rodney G. Downey, and Michael R. Fellows. Applications of parameterized complexity to problems of parallel and distributed computation, 1994. Unpublished extended abstract.
4. Hans L. Bodlaender and Torben Hagerup. Parallel algorithms with optimal speedup for bounded treewidth. Technical Report UU-CS-1995-25, Department of Computer Science, Utrecht University, 1995.
5. A. K. Chandra, D. C. Kozen, and L. J. Stockmeyer. Alternation. J. of the ACM, 28, 114–133, 1981.
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献