Author:
Weimann Oren,Yuster Raphael
Publisher
Springer Berlin Heidelberg
Reference20 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(4), 1167–1181 (1999)
2. Lecture Notes in Computer Science;P. Berman,2007
3. Lecture Notes in Computer Science;K. Boitmanis,2006
4. Lecture Notes in Computer Science;V. Chepoi,1994
5. Chung, F.R.K.: Diameters of graphs: Old problems and new results. Congressus Numerantium 60, 295–317 (1987)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献