Hard in theory, easy in practice: Why graph isomorphism algorithms seem to be so effective
In discrete mathematics, they are structures that ... whereby the algorithm studies the connections of each node in the graph ...