Hard in theory, easy in practice: Why graph isomorphism algorithms seem to be so effective by Andreas Rothe, Institute of Science and Technology Austria ...

To mathematicians, a graph often looks different than what most of us are taught in school. A graph in this case is any number of points, called nodes, connected by pairwise relations, called edges.

Abstractions blog A New Algorithm for Graph Crossings, Hiding in Plain Sight Two computer scientists found — in the unlikeliest of places — just the idea they needed to make a big leap in graph theory ...