Efficient Graph Sub-Sampling Strategies for Divide-and-Conquer Algorithms in Large Networks

Effective sub-sampling of large graphs is crucial for applying divide-and-conquer algorithms to network analysis tasks. Different sub-sampling routines can have a significant impact on the performance of these algorithms.