Skip to main content
. 2021 Aug 30;5(3):711–733. doi: 10.1162/netn_a_00199

Figure 3. .

Figure 3. 

The red and blue nodes in the two rows represent the two graphs G1 = (V1, E1) and G2 = (V2, E2) being aligned. The displayed complete bipartite graph is the one constructed in the second step of the WL-align algorithm. Each edge has weight equal to the Euclidean distance between the signatures of the nodes that it connects. For instance, the weight associated with the edge connecting nodes uV1 and vV2 is ∥HuHv2, where Hu and Hv are the signatures of nodes u and v defined in the first step of the WL-align algorithm.