v1v2v3 (latest)

Computing Shortest Paths and Diameter in the Hybrid Network Model

15 June 2020

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

21 / 21 papers shown

Title
Routing Schemes for Hybrid Communication Networks Samantha R. Coy A. Czumaj Christian Scheideler P. Schneider Julian Werthmann 37 3 0 11 Oct 2022
Computing Power of Hybrid Models in Synchronous Networks Pierre Fraigniaud Pedro Montealegre Pablo Paredes I. Rapaport Martín Ríos-Wilson Ioan Todinca 75 2 0 04 Aug 2022
Distributed Computing With the Cloud Y. Afek Gal Giladi B. Patt-Shamir 81 7 0 27 Sep 2021
Efficient Stepping Algorithms and Implementations for Parallel Shortest Paths Xiaojun Dong Yan Gu Yihan Sun Yunming Zhang 84 35 0 13 May 2021
Time-Optimal Construction of Overlay Networks Thorsten Götte Kristian Hinnenthal Christian Scheideler Julian Werthmann 81 21 0 08 Sep 2020
Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs Michel Feldmann Kristian Hinnenthal Christian Scheideler 64 23 0 02 Jul 2020
Shortest Paths in a Hybrid Network Model John E. Augustine Kristian Hinnenthal Fabian Kuhn Christian Scheideler P. Schneider 70 33 0 04 Sep 2019
Fast Approximate Shortest Paths in the Congested Clique K. Censor-Hillel Michal Dory Janne H. Korhonen Dean Leitersdorf 91 55 0 14 Mar 2019
Distributed Exact Weighted All-Pairs Shortest Paths in Near-Linear Time A. Bernstein K. Kirchberg 107 53 0 08 Nov 2018
Deterministic Distributed Ruling Sets of Line Graphs Fabian Kuhn Yannic Maus Simon Weidner 59 25 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 55 38 0 15 Apr 2018
Sparse Matrix Multiplication and Triangle Listing in the Congested Clique Model K. Censor-Hillel Dean Leitersdorf Elia Turner 96 35 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 101 45 0 13 Aug 2017
Further Algebraic Algorithms in the Congested Clique Model and Applications to Graph-Theoretic Problems F. Gall 64 48 0 09 Aug 2016
A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths Monika Henzinger Sebastian Krinninger Danupon Nanongkai 165 111 0 27 Apr 2015
Algebraic Methods in the Congested Clique K. Censor-Hillel P. Kaski Janne H. Korhonen Christoph Lenzen A. Paz Jukka Suomela 58 161 0 17 Mar 2015
Fast Partial Distance Estimation and Applications Christoph Lenzen B. Patt-Shamir 89 63 0 26 Dec 2014
Approximation of Distances and Shortest Paths in the Broadcast Congest Clique S. Holzer N. Pinsker 106 57 0 10 Dec 2014
Fast Routing Table Construction Using Small Messages Christoph Lenzen B. Patt-Shamir 123 77 0 21 Oct 2012
Optimal Deterministic Routing and Sorting on the Congested Clique Christoph Lenzen 137 172 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 163 345 0 12 Nov 2010