Fig. 8
From: Revisiting the complexity of and algorithms for the graph traversal edit distance and its variants
a Subgraphs \(G_1^{sub}\) and \(G_2^{sub}\) of input graphs \(G_1\) and \(G_2\). Dots represent a path from node 1 to \(k-1\) with middle nodes omitted. b The alignment graph \(\mathcal {A} (G_1^{sub}, G_2^{sub})\) with different edges labeled with colors. c A subgraph of the alignment graph in b with edges and triangles numbered. Dots represent horizontal and diagonal edges omitted. The same vertices that are repeated in c are marked with yellow and red filling colors