Abstract
The problem of determining whether a k-connected partial k-tree is isomorphic to subgraph of another k-connected partial k-tree is shown to be solvable in time O(nk+2). For k = 2, and k = 3, the stronger time-bound of O(n3.5) is obtained. 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.
Cite
CITATION STYLE
Dessmark, A., Lingas, A., & Proskurowski, A. (1996). Faster algorithms for subgraph isomorphism of k-Connected partial k-Trees. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1136, pp. 501–513). Springer Verlag. https://doi.org/10.1007/3-540-61680-2_78
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
