In order to determine the kernel value, it is necessary to compute the value of k walk for all pairs of edges between the two transformed graphs.
the number of edges in the transformed graph can be at most n 2 in the case all the shortest paths in the original graph are no longer than d. there are at most n 2 • n 2 = n 4 pairs of edges.