Tight Bounds for Subgraph Isomorphism and Graph Homomorphism.
Fedor V. FominAlexander GolovnevAlexander S. KulikovIvan MihajlinPublished in: CoRR (2015)
Keyphrases
- subgraph isomorphism
- tight bounds
- graph matching
- upper bound
- graph databases
- graph pattern matching
- graph isomorphism
- weighted graph
- graph patterns
- maximum common subgraph
- edit distance
- graph mining
- search tree
- graph matching algorithm
- depth first search
- frequent subgraphs
- graph model
- branch and bound algorithm
- graph data
- hard problems
- objective function
- matching algorithm
- binary images
- pairwise
- object recognition
- pattern recognition
- search algorithm