The Complexity of Subgraph Isomorphism for Classes of Partial k-Trees.

Arvind Gupta Naomi Nishimura

Published in: Theor. Comput. Sci. (1996)

Keyphrases

subgraph isomorphism
graph matching
hard problems
relational databases
tree structure
search tree
edit distance
graph databases
search algorithm
object recognition
pairwise
weighted graph
graph pattern matching
maximum common subgraph