Breadth First Search on Massive Graphs

Deepak Ajwani, Ulrich Meyer, Vitaly Osipov. Breadth First Search on Massive Graphs. In Camil Demetrescu, Andrew V. Goldberg, David S. Johnson, editors, The Shortest Path Problem, Proceedings of a DIMACS Workshop, Piscataway, New Jersey, USA, November 13-14, 2006. Volume 74 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 291-308, DIMACS/AMS, 2006.

Abstract

Abstract is missing.