Graphs are everywhere. In discrete mathematics, they are structures that show the connections between points, much like a public transportation network. Mathematicians have long sought to develop ...

Theoretical computer scientists are normally a fairly sedate bunch, but are humming with excitement after a potential breakthrough in a long-standing problem called graph isomorphism. The result could ...

An innovative approach to solving a stubborn, but elementary, question in graph theory — the mathematical study of networks of nodes and their connections — may signal the first major theoretical ...

Complexity fans and algorithm researchers are excitedly whispering this week about what might be the “the theoretical computer science result of the decade,” in the words of MIT professor Scott ...