Distributed approximate minimal Steiner trees with millions of seed vertices on billion-edge graphs

Tahsin Reza, Trevor Steil, Geoffrey Sanders, Roger Pearce

Abstract: Highlights•Voronoi cell computation is an enabler for scaling to large graphs and seed sets.•Message prioritization accelerates convergence of distance computation.•Combining vertex- and edge- centric processing can bring forth superior performance.•2-approx. MST can preserve the theoretical bound of a 2-approx. Steiner tree algo.