Distance Patterns in Structural Similarity
Thomas Kämpke; 7(74):2065−2086, 2006.
Abstract
Similarity of edge labeled graphs is considered in the sense of minimum squared distance between corresponding values. Vertex correspondences are established by isomorphisms if both graphs are of equal size and by subisomorphisms if one graph has fewer vertices than the other. Best fit isomorphisms and subisomorphisms amount to solutions of quadratic assignment problems and are computed exactly as well as approximately by minimum cost flow, linear assignment relaxations and related graph algorithms.
[abs]
[pdf][bib]| © JMLR 2006. (edit, beta) |