Author:
Baswana Surender,Gaur Akshay,Sen Sandeep,Upadhyay Jayant
Publisher
Springer Berlin Heidelberg
Reference12 articles.
1. Aingworth, D., Chekuri, C., Indyk, P., Motwani, R.: Fast estimation of diameter and shortest paths(without matrix multiplication). SIAM Journal on Computing 28, 1167–1181 (1999)
2. Lecture Notes in Computer Science;S. Baswana,2005
3. Baswana, S., Kavitha, T.: Faster algorithms for approximate distance oracles and all-pairs small stretch paths. In: Proceedings of the 47th IEEE Annual Symposium on Foundations of Computer Science (FOCS), pp. 591–602 (2006)
4. Baswana, S., Sen, S.: Approximate distance oracles for unweighted graphs in expected O(n
2) time. ACM Transactions on Algorithms 2, 557–577 (2006)
5. Baswana, S., Telikepalli, K., Mehlhorn, K., Pettie, S.: New construction of (α,β)-spanners and purely additive spanners. In: Proceedings of 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 672–681 (2005)
Cited by
23 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献