A similarity measure for graphs with low computational complexity.
Matthias DehmerFrank Emmert-StreibJürgen KilianPublished in: Appl. Math. Comput. (2006)
Keyphrases
- similarity measure
- computational complexity
- pairwise
- graph matching
- graph model
- mutual information
- measuring similarity
- np complete
- clustering method
- graph theoretic
- special case
- graph theory
- edit distance
- memory requirements
- np hard
- feature vectors
- decision problems
- graph mining
- similarity function
- weighted graph
- storage requirements
- similarity metric
- worst case
- graph clustering
- random graphs
- high computational complexity
- similarity computation
- subgraph isomorphism
- similarity assessment
- semantic similarity