1 paper
Michael Anastos, Matthew Kwan, Benjamin Moore
There is no known polynomial-time algorithm for graph isomorphism testing, but elementary combinatorial "refinement" algorithms seem to be very efficient in practice. Some philosop…