Parallel edge-based sampling for static and dynamic graphs
Kartik Lakhotia, Rajgopal Kannan, Aditya Gaur, Ajitesh Srivastava, Viktor K. Prasanna · 2019
Graph sampling is an important tool to obtain small and manageable subgraphs from large real-world graphs. Prior research has shown that Induced Edge Sampling (IES) outperforms other sampling methods in terms of the quality of subgraph obtained. Even though fast sampling is crucial for several workflows, there has been little work on parallel sampling algorithms in the past.