Mathematicians have long sought to develop algorithms that can compare any two graphs. In practice, many ...

Two computer scientists found — in the unlikeliest of places — just the idea they needed to make a big leap in graph theory.

A new algorithm efficiently solves the graph isomorphism problem, which has puzzled computer scientists for decades.

Picasso slims the data To lighten the computational burden, the PNNL team turned to a type of algorithm known as graph coloring—a specialty of Ferdous and Halappanavar.