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

A professor has helped create a powerful new algorithm that uncovers hidden patterns in complex networks, with potential uses in fraud detection, biology and knowledge discovery.

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.