Polynomial Time Symmetry and Isomorphism Testing for Connected Graphs
  We use the concept of a Kirchhoff resistor network (alternatively random walk on a network) to probe connected graphs and produce symmetry revealing canonical labelings of the graph(s) nodes and edges. 
Matthew Delacorte