1 paper · 1 filter
Tim Baer, Raghavendra Kanakagiri, Edgar Solomonik
Formulations of graph algorithms using sparse linear algebra have yielded highly scalable distributed algorithms for problems such as connectivity and shortest path computation. We…