Is there a generalization of the levenshtein distance for searching for structures in graphs?
Asked
Active
Viewed 343 times
4
-
These are helpful links. I'm not sure what I meant specifically. Just looking for some leads to refine my understanding of graph search and comparison. – 234523458 Aug 02 '10 at 18:35
1 Answers
0
This paper might be of interest: Structural Similarity in Graphs
I am however afraid that calculating such distance would be very computationally intensive, most likely either NP or NP complete.
Roman Zenka
- 3,514
- 3
- 31
- 36