V-Combiner
Azin Heidarshenas, Şerif Yeşil, Dimitrios Skarlatos, Saša Misailovíc, Adam Morrison, Josep Torrellas · 2020
An iterative graph algorithm applies a vertex update operation to all vertices in a graph in every iteration. For large graphs, this computation is costly. However, in practice, not all the updates contribute equally to the end result and, in fact, an exact result may not be needed. In this work, we leverage these insights to speed-up iterative graph algorithms. We propose a mechanism to identify the less important vertices and omit computations for them.