Large-scale energy-efficient graph traversal: a path to efficient data-intensive supercomputing
A work-efficient parallel breadth-first search algorithm (or how to cope with the nondeterminism of reducers)