in-exact graph matching

Hey,

Can anyone tell me what is state-of-the-art and yet mature algorithm
doing "inexact graph matching"? 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

.