A plot of the rescaled eigenvalue spectrum of horizontal visibility graphs in the Feigenbaum scenario. (Courtesy: J. Phys. A: Math. Theor. 10.1088/1751-8121/ab587f) By means of the so-called ...

A puzzle that has long flummoxed computers and the scientists who program them has suddenly become far more manageable. A new algorithm efficiently solves the graph isomorphism problem, computer ...

Graphs are everywhere. In discrete mathematics, they are structures that show the connections between points, much like a ...

Two computer scientists found — in the unlikeliest of places — just the idea they needed to make a big leap in graph theory. This past October, as Jacob Holm and Eva Rotenberg were thumbing through a ...