Seeded Graph Matching via Large Neighborhood Statistics
Isomorphism of graphs of bounded valence can be tested in polynomial time