The method of claim 6, further comprising: clustering the filtered graph embeddings using the clustering algorithm; identifying clusters having fewer than a threshold value T of graph embeddings ...

Since the 1970s, algorithms have been able to test graph isomorphism, but in exponential time. This means that the increasing complexity of the graphs increased the algorithm's running time ...