1 paper
Oded Green, James Fox, Jeffrey Young +2
Graph processing is typically considered to be a memory-bound rather than compute-bound problem. One common line of thought is that more available memory bandwidth corresponds to b…