Author:
Bodlaender Hans L.,Fellows Mike R.,Warnow Tandy J.
Publisher
Springer Berlin Heidelberg
Reference59 articles.
1. S. Arnborg. Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A survey. BIT, 25:2–23, 1985.
2. S. Arnborg, D. Corneil, and A. Proskurowski. Complexity of finding embeddings in a k-tree. SIAM J. Alg. Discr. Meth., 8:277–284, 1987.
3. S. Arnborg, B. Courcelle, A. Proskurowski, and D. Seese. An algebraic theory of graph reduction. Technical Report 90-02, Laboratoire Bordelais de Recherche en Informatique, Bordeaux, 1990. To appear in Proceedings 4th Workshop on Graph Grammars and Their Applications to Computer Science.
4. S. Arnborg, J. Lagergren, and D. Seese. Easy problems for tree-decomposable graphs J. Algorithms, 12:308–340, 1991.
5. S. Arnborg and A. Proskurowski. Linear time algorithms for NP-hard problems restricted to partial k-trees. Disc. Appl. Math., 23:11–24, 1989.
Cited by
86 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献