| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1709439 | Applied Mathematics Letters | 2008 | 9 Pages |
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.
Related Topics
Physical Sciences and Engineering
Engineering
Computational Mechanics
Authors
Laura A. Zager, George C. Verghese,