Faster Algorithms for Subgraph Isomorphism of \sl k -Connected Partial \sl k -Trees

Abstract.

The problem of determining whether a k -connected partial k -tree is isomorphic to a subgraph of another partial k -tree is shown to be solvable in time O(n ^k+2 ) . The presented time-bounds considerably improve the corresponding bounds known in the literature. They rely in part on a new characterization of width-k tree-decomposition of k -connected partial k -trees.