Baswana, Surender Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Sen, Sandeep Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Baswana, S., & Sen, S. (2004). Approximate distance oracle for unweighted graphs in Õ(n²) time. In Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04) (pp. 271-280). New York, USA: ACM.