Graph sub-sampling for divide-and-conquer algorithms in large networks

Eric Yanchenko

As networks continue to increase in size, current methods must be capable of handling large numbers of nodes and edges in order to be practically relevant. Instead of working direc…