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

We present scalability results of a parallel graph coloring algorithm, three variations of a breadth-first search algorithm and a microbenchmark for irregular computations using these three programming ...