Some works utilize looser restrictions on matching such as homomorphism [1]} and simulation [2]}, [3]}Due to lack of space, we refrain from their definition on this paper but we encourage interested readers to refer to the cited works.. Other variants include the temporal ordering of the edges [4]}, automorphism removal [5]}, [6]}, and approximate matching [7]}. All of these solutions first find matches of individual edges(nodes) and combine them while confirming to the desired level of structural similarity. Using the edgeMatcher() and enumerator() functions in API, a user can implement all these variants and many more without having to redesign the whole system stack as we demonstrate in our evaluation.
