Vanderbilt
February 1st, 2007, 01:25 PM
Hey, Gurus
Can anyone tell me what is state-of-the-art and yet mature algorithm
doing "inexact graph matching" (Approximate best possible matching of two graphs, a node in one graph can match to at most one node in the other graph and vice versa, missing node and link is allowed(hence in-exact))?
Its application area include subgraph isomorphism, weighted graph matching and attributed relational graph matching, etc.
From my research on the net, it seems
Graduated Assignment is a good candidate. But it was from paper of 10
years ago, (A Graduated Assignment Algorithm for Graph Matching, by
Steven Gold, and Anand Rangarajan), TPAMI, 96.
And I will appreciate it if you could point me towards some open
source code of THEM (either GA, or other mature ones).
Van
Can anyone tell me what is state-of-the-art and yet mature algorithm
doing "inexact graph matching" (Approximate best possible matching of two graphs, a node in one graph can match to at most one node in the other graph and vice versa, missing node and link is allowed(hence in-exact))?
Its application area include subgraph isomorphism, weighted graph matching and attributed relational graph matching, etc.
From my research on the net, it seems
Graduated Assignment is a good candidate. But it was from paper of 10
years ago, (A Graduated Assignment Algorithm for Graph Matching, by
Steven Gold, and Anand Rangarajan), TPAMI, 96.
And I will appreciate it if you could point me towards some open
source code of THEM (either GA, or other mature ones).
Van