Graph similarity scoring and matching

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....

Full description

Saved in:
Bibliographic Details
Published inApplied mathematics letters Vol. 21; no. 1; pp. 86 - 94
Main Authors Zager, Laura A., Verghese, George C.
Format Journal Article
LanguageEnglish
Published Oxford Elsevier Ltd 2008
Elsevier
Subjects
Exact sciences and technology
Graph algorithms
Graph alignment
Graph matching
Graphs and networks
Mathematical analysis
Mathematics
Numerical analysis
Numerical analysis. Scientific computation
Sciences and techniques of general use
Similarity measures
Graph alignment
Graph algorithms
Similarity measures
Graphs and networks
Graph matching
Applied mathematics
Algorithm
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:0893-9659
1873-5452
DOI:10.1016/j.aml.2007.01.006