Tight Bounds for Graph Homomorphism and Subgraph Isomorphism.
Marek CyganFedor V. FominAlexander GolovnevAlexander S. KulikovIvan MihajlinJakub PachockiArkadiusz SocalaPublished in: SODA (2016)
Keyphrases
- subgraph isomorphism
- tight bounds
- graph matching
- upper bound
- graph databases
- graph isomorphism
- graph mining
- graph pattern matching
- weighted graph
- search tree
- edit distance
- maximum common subgraph
- graph matching algorithm
- graph patterns
- graph data
- query graph
- frequent subgraphs
- connected components
- search space
- depth first search
- lower bound
- structured data
- relational databases
- search algorithm
- similarity measure
- data mining