Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. Awerbuch, B., Berger, B., Cowen, L., Peleg, D.: Near-linear time construction of sparse neighborhood covers. SIAM J. Comput. 28(1), 263–277 (1998)
2. Awerbuch, B., Peleg, D.: Sparse partitions. In: Proceedings of the 31st IEEE Annual Symposium on Foundations of Computer Science (FOCS 1990), pp. 503–513 (1990)
3. Busch, C., LaFortune, R., Tirthapura, S.: Improved sparse covers for graphs excluding a fixed minor. In: Proceedings of the 26th Annual ACM symposium on Principles of Distributed Computing (PODC 2007), pp. 61–70 (2007)
4. Chechik, S.: Approximate distance oracle with constant query time. In: Proceedings of the 46th Annual ACM Symposium on Theory of Computing (STOC 2014), pp. 654–663 (2014)
5. Delling, N., Goldberg, A., Pajor, T., Werneck, R.: Robust exact distance queries on massive networks. In: Microsoft Research Technique report, MSR-TR-2014-12 (2014)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献