@inproceedings{50a05651bacd4ac89ad60440e3baf77f,
title = "Fast estimation of diameter and shortest paths (Without matrix multiplication)",
author = "D. Aingworth and C. Chekuri and R. Motwani",
note = "Funding Information: {\textquoteleft}Department of Computer Science, Stanford University. Email: donald(0cs .stanford .edu. Supported by an NSF Graduate Fellowship and NSF Grant CCR-9357849. {\textquoteleft}Department of Computer Science, Stanford University. Email: chekuriecs. Stanford. edu. Supported by an OTL grant and NSF Grant CCR-9357849. tDepartment of Computer Science, Stanford University. Email: rajeevQcs.stanford.edu. Supported by an Alfred P. Sloan Research Fellowship, an IBM Faculty Development Award, an OTL grant, and NSF Young Investigator Award CCR-9357849, with matching funds from IBM, Schlumberger Foundation, Shell Foundation, and Xerox Corporation. {\textquoteleft}The notation d(f(n)) denotes O(f(n) polylog(n)).; 7th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1996 ; Conference date: 28-01-1996 Through 30-01-1996",
year = "1996",
month = jan,
day = "28",
language = "English (US)",
series = "Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms",
publisher = "Association for Computing Machinery",
pages = "547--553",
booktitle = "Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1996",
}