Fast Approximate Distance Queries in Unweighted Graphs Using Bounded Asynchrony

Adam Fidel, Francisco Coral-Sabido, Colton Riedel, Nancy M. Amato, Lawrence Rauchwerger. Fast Approximate Distance Queries in Unweighted Graphs Using Bounded Asynchrony. In Chen Ding, John Criswell, Peng Wu 0001, editors, Languages and Compilers for Parallel Computing - 29th International Workshop, LCPC 2016, Rochester, NY, USA, September 28-30, 2016, Revised Papers. Volume 10136 of Lecture Notes in Computer Science, pages 40-54, Springer, 2016. [doi]

Abstract

Abstract is missing.