Transcription of Algorithms for Graph Similarity and Subgraph Matching
{{id}} {{{paragraph}}}
Algorithms for Graph Similarityand Subgraph MatchingDanai KoutraComputer Science DepartmentCarnegie Mellon ParikhMachine Learning DepartmentCarnegie Mellon RamdasMachine Learning DepartmentCarnegie Mellon XiangMachine Learning DepartmentCarnegie Mellon 4, 2011 AbstractWe deal with two independent but related problems, those of Graph Similarity and subgraphmatching, which are both important practical problems useful in several fields of science, engineer-ing and data analysis. For the problem of Graph Similarity , we develop and test a new frameworkfor solving the problem using belief propagation and related ideas.
Given: two graphs G 1(n 1;e 1) and G 2(n 2;e 2), with possibly different number of nodes and edges, and the mapping between the graphs’ nodes. Find: (a) an algorithm to calculate the similarity of the two graphs, which returns (b) a measure of
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document:
{{id}} {{{paragraph}}}