1. S. Arnborg, B. Courcelle, A. Proskurowski, and D. Seese. An algebraic theory of graph reduction. J. ACM, 40:1134–1164, 1993.
2. M. W. Bern, E. L. Lawler, and A. L. Wong. Linear time computation of optimal subgraphs of decomposable graphs. J. Algorithms, 8:216–235, 1987.
3. H. L. Bodlaender and B. de Fluiter. Reduction algorithms for graphs with small treewidth. Technical Report UU-CS-1995-37, Department of Computer Science, Utrecht University, Utrecht, 1995.
4. H. L. Bodlaender and T. Hagerup. Parallel algorithms with optimal speedup for bounded treewidth. In Z. Fülöp and F. Gécseg, editors, Proceedings 22nd International Colloquium on Automata, Languages and Programming, pages 268–279, Berlin, 1995. Springer-Verlag, Lecture Notes in Computer Science 944.
5. R. B. Borie, R. G. Parker, and C. A. Tovey. Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families. Algorithmica, 7:555–581, 1992.