The Hardness of Subgraph Isomorphism.
Marek CyganJakub PachockiArkadiusz SocalaPublished in: CoRR (2015)
Keyphrases
- subgraph isomorphism
- graph matching
- graph pattern matching
- search tree
- graph databases
- edit distance
- phase transition
- maximum common subgraph
- hard problems
- graph mining
- weighted graph
- computational complexity
- np complete
- depth first search
- np hard
- social network analysis
- graph data
- matching algorithm
- data model
- relational databases
- graph patterns
- frequent subgraphs
- pattern recognition
- data structure
- similarity measure