Finding Matching Subtrees
•For each pair of vertexes from G1 and G2, compute
vertex distance times the Euclidean distance
between their χ vectors.
•From the
minimum weight, maximal size matching, pick the least-weight edge.
–Recurse down each vertex’s subtree, finding best matches in maximal matching and building a subtree match.
–Remove subtrees of all matched vertexes, and repeat.