Polynomial Time Algorithms for Variants of Graph Matching on Partial k-Trees

Abstract

In this paper, we deal with two variants of graph matching, the graph isomorphism with restriction and the prefix set of graph isomorphism. The former problem is known to be NP-complete, whereas the latter problem is known to be GI-complete. We propose polynomial time exact algorithms for these problems on partial k-trees.

Keywords

• graph isomorphism with restriction
• partial k-trees
• polynomial time algorithm