Characterizing the Complexity of Subgraph Isomorphism for Graphs of Bounded Path-Width.
Arvind GuptaNaomi NishimuraPublished in: STACS (1996)
Keyphrases
- subgraph isomorphism
- graph matching
- maximum common subgraph
- graph isomorphism
- graph databases
- graph pattern matching
- search tree
- weighted graph
- edit distance
- graph mining
- graph matching algorithm
- graph patterns
- depth first search
- shortest path
- query graph
- structured data
- conp complete
- graph data
- frequent subgraphs
- pattern recognition
- pattern matching
- object recognition