Fast exact graph matching using adjacency matrices
Marlon Etheredge · 2012
This paper introduces a technique of graph subgraph searching, that allows for varied complex subgraphs to be matched in directed or undirected target graphs in a fast and flexible manner. Along with a discussion on the contrast with other known algorithms, benchmarks are presented that compare these known algorithms to the algorithm that is presented in this paper.