Name
Abstract | ||
|---|---|---|
We outline a class of graph similarity measures that uses the structural similarity of local neighborhoods to derive pairwise similarity scores for the nodes of two different graphs, and present a related similarity measure that uses a linear update to generate both node and edge similarity scores. This measure is then applied to the task of graph matching. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1016/j.aml.2007.01.006 | Applied Mathematics Letters |
Keywords | Field | DocType |
Graphs and networks,Graph algorithms,Similarity measures,Graph matching,Graph alignment | Graph similarity,Similarity measure,Similarity (network science),Normalized compression distance,Structural similarity,Artificial intelligence,Semantic similarity,Pairwise comparison,Mathematical optimization,Combinatorics,Pattern recognition,Matching (graph theory),Mathematics | Journal |
Volume | Issue | ISSN |
21 | 1 | 0893-9659 |
Citations | PageRank | References |
68 | 2.25 | 12 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Laura A. Zager | 1 | 70 | 2.69 |
| George C. Verghese | 2 | 208 | 26.26 |