Variants of Graph Matching for Tree-like Graphs
Takayuki Nagoya · 2015
Graphs can be effectively used to represent relationships between objects such as social networks, web search engines and genome sequencing. In this paper, we deal with two variants of graph matching, the graph isomorphism with restriction and the prefix set of graph isomorphism. We propose polynomial-time exact algorithms for these problems on graphs with tree-like structure. These could be useful tools for big data processing.