Fast Approximate Distance Queries in Unweighted Graphs Using Bounded Asynchrony - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Adam Fidel' in GoogleThis author has not been identified. Look up 'Francisco Coral-Sabido' in GoogleThis author has not been identified. Look up 'Colton Riedel' in GoogleThis author has not been identified. Look up 'Nancy M. Amato' in GoogleThis author has not been identified. Look up 'Lawrence Rauchwerger' in Google

runs on WebDSL