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.

University of Virginia School of Engineering and Applied Science professor Nikolaos Sidiropoulos has introduced a breakthrough in graph mining with the development of a new computational algorithm.

A theoretical computer scientist has presented an algorithm that is being hailed as a breakthrough in mapping the obscure terrain of complexity theory, which explores how hard computational problems ...

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 ...

In this paper, we present a branch-and-price method to solve special structured multistage stochastic integer programming problems. We validate our method on two different versions of a multistage ...