Computing Shortest Paths and Diameter in the Hybrid Network Model

v1v2v3 (latest)

Computing Shortest Paths and Diameter in the Hybrid Network Model

15 June 2020

ArXiv (abs)PDF HTML

Papers citing "Computing Shortest Paths and Diameter in the Hybrid Network Model"

19 / 19 papers shown

Title
Computing Power of Hybrid Models in Synchronous Networks Pierre Fraigniaud Pedro Montealegre Pablo Paredes I. Rapaport Martín Ríos-Wilson Ioan Todinca 50 2 0 04 Aug 2022
Distributed Computing With the Cloud Y. Afek Gal Giladi B. Patt-Shamir 62 7 0 27 Sep 2021
Efficient Stepping Algorithms and Implementations for Parallel Shortest Paths Xiaojun Dong Yan Gu Yihan Sun Yunming Zhang 58 33 0 13 May 2021
Time-Optimal Construction of Overlay Networks Thorsten Götte Kristian Hinnenthal Christian Scheideler Julian Werthmann 46 21 0 08 Sep 2020
Shortest Paths in a Hybrid Network Model John E. Augustine Kristian Hinnenthal Fabian Kuhn Christian Scheideler P. Schneider 44 31 0 04 Sep 2019
Fast Approximate Shortest Paths in the Congested Clique K. Censor-Hillel Michal Dory Janne H. Korhonen Dean Leitersdorf 56 54 0 14 Mar 2019
Distributed Exact Weighted All-Pairs Shortest Paths in Near-Linear Time A. Bernstein K. Kirchberg 62 53 0 08 Nov 2018
Deterministic Distributed Ruling Sets of Line Graphs Fabian Kuhn Yannic Maus Simon Weidner 37 26 0 18 May 2018
$A Deterministic Distributed Algorithm for Exact Weighted All-Pairs Shortest Paths in $\tilde{O}(n^{3/2})$ Rounds$ A Deterministic Distributed Algorithm for Exact Weighted All-Pairs Shortest Paths in $\tilde{O}(n^{3/2})$ Rounds U. Agarwal V. Ramachandran Valerie King Matteo Pontecorvi 26 38 0 15 Apr 2018
Sparse Matrix Multiplication and Triangle Listing in the Congested Clique Model K. Censor-Hillel Dean Leitersdorf Elia Turner 46 34 0 13 Feb 2018
$Distributed Exact Weighted All-Pairs Shortest Paths in $\tilde O(n^{5/4})$ Rounds$ Distributed Exact Weighted All-Pairs Shortest Paths in $\tilde O(n^{5/4})$ Rounds Chien-Chung Huang Danupon Nanongkai Thatchaphol Saranurak 51 45 0 13 Aug 2017
Further Algebraic Algorithms in the Congested Clique Model and Applications to Graph-Theoretic Problems F. Gall 44 48 0 09 Aug 2016
A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths Monika Henzinger Sebastian Krinninger Danupon Nanongkai 104 112 0 27 Apr 2015
Algebraic Methods in the Congested Clique K. Censor-Hillel P. Kaski Janne H. Korhonen Christoph Lenzen A. Paz Jukka Suomela 54 160 0 17 Mar 2015
Fast Partial Distance Estimation and Applications Christoph Lenzen B. Patt-Shamir 58 62 0 26 Dec 2014
Approximation of Distances and Shortest Paths in the Broadcast Congest Clique S. Holzer N. Pinsker 74 57 0 10 Dec 2014
Fast Routing Table Construction Using Small Messages Christoph Lenzen B. Patt-Shamir 98 76 0 21 Oct 2012
Optimal Deterministic Routing and Sorting on the Congested Clique Christoph Lenzen 104 169 0 08 Jul 2012
Distributed Verification and Hardness of Distributed Approximation Atish Das Sarma S. Holzer Liah Kor Amos Korman Danupon Nanongkai Gopal Pandurangan David Peleg Roger Wattenhofer 114 346 0 12 Nov 2010