Fast suboptimal algorithms for the computation of graph edit distance
Isomorphism of graphs of bounded valence can be tested in polynomial time