Graph Matching - Algorithms - TU Wien:图匹配算法的TU Wien - 豆丁...
Exact Matching Ullmann’s Algorithm Exact Matching Ullmann’s Algorithm Given: Two graphs G A (V A , E A ) and G B (V B , E B ) and their adjacency matrices: A and B Idea: n = |V a |, m = |V b |, n ×m permutat