Author:
Manoharan Vignesh,Ramachandran Vijaya
Publisher
Springer Nature Switzerland
Reference34 articles.
1. Abboud, A., Censor-Hillel, K., Khoury, S.: Near-linear lower bounds for distributed distance computations, even in sparse networks. In: Gavoille, C., Ilcinkas, D. (eds.) Proceedings of DISC 2016, pp. 29–42. Springer, Heidelberg (2016). https://doi.org/10.1007/978-3-662-53426-7_3
2. Abboud, A., Grandoni, F., Williams, V.V.: Subcubic equivalences between graph centrality problems, apsp and diameter. In: Proceedings of SODA 2015, pp. 1681–1697. SIAM (2015)
3. Agarwal, U., Ramachandran, V.: Fine-grained complexity for sparse graphs. In: Proceedings of STOC 2018, pp. 239–252 (2018)
4. Agarwal, U., Ramachandran, V.: Faster deterministic all pairs shortest paths in congest model. In: SPAA 2020, pp. 11–21. ACM (2020)
5. Ancona, B., Censor-Hillel, K., Dalirrooyfard, M., Efron, Y., Williams, V.V.: Distributed distance approximation. In: OPODIS 2020, vol. 184, pp. 30:1–30:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)