For a graph of m nodes and n edges, an algorithm for testing the isomorphism of graphs is given. The complexity of the algorithm is a maximum of O(mn(2)) in almost all cases, with a considerable reduction if sparsity is exploited. If isomorphism is prese
