Sequential and Parallel Algorithms for Embedding Problems on Classes of Partial k-Trees

We present sequential and parallel algorithms for various embedding problems on bounded degree partial k-trees and k-connected partial k-trees these include subgraph isomorphism and topological embedding, known to be NP-complete for general partial k-trees. As well as contributing to our understanding of the types of graphs for which these problems are tractable, this paper introduces new methods for solving problems on graphs. In particular, we make use of a tree-like representation of the graph (the tree-decomposition of the graph) to apply techniques used to solve problems on trees to solve problems on more general classes of graphs.

• Type: Conference
• Year: 1994
• Where: SWAT
• Authors: Arvind Gupta, Naomi Nishimura
• Keywords: Algorithms, Degree Partial K-trees, Partial K-trees, SWAT 1994, Various Embedding Problems