Your search returned the following 2 documents:

2. Breadth first search on massive graphs
   Deepak Ajwani, Ulrich Meyer, and Vitaly Osipov
   In: The shortest path problem : ninth DIMACS implemenation challenge, 2009, 291-307
   
1. Ultrafast shortest-path queries via transit nodes
   Holger Bast, Stefan Funke, and Domagoj Matijevic
   In: The shortest path problem : ninth DIMACS implemenation challenge, 2009, 175-192