Tight Bounds for Distributed Minimum-Weight Spanning Tree Verification

15 December 2015

Papers citing "Tight Bounds for Distributed Minimum-Weight Spanning Tree Verification"

11 / 11 papers shown

Title
Tight Bounds on the Message Complexity of Distributed Tree Verification S. Kutten Peter Robinson Ming Ming Tan 47 1 0 22 Jan 2024
Distributed Weighted Min-Cut in Nearly-Optimal Time Michal Dory Yuval Efron Sagnik Mukhopadhyay Danupon Nanongkai 63 23 0 20 Apr 2020
Distributed Edge Connectivity in Sublinear Time Mohit Daga Monika Henzinger Danupon Nanongkai Thatchaphol Saranurak 55 40 0 08 Apr 2019
Distributed Exact Weighted All-Pairs Shortest Paths in Near-Linear Time A. Bernstein K. Kirchberg 62 53 0 08 Nov 2018
A Faster Distributed Single-Source Shortest Paths Algorithm Sebastian Krinninger Danupon Nanongkai 66 66 0 03 Nov 2017
$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 56 45 0 13 Aug 2017
A Time- and Message-Optimal Distributed Algorithm for Minimum Spanning Trees Gopal Pandurangan Peter Robinson Michele Scquizzato 28 54 0 23 Jul 2016
Survey of Distributed Decision Laurent Feuilloley Pierre Fraigniaud 82 47 0 14 Jun 2016
Near-Linear Lower Bounds for Distributed Distance Computations, Even in Sparse Networks Amir Abboud K. Censor-Hillel Seri Khoury 45 75 0 17 May 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
Randomized Distributed Decision Pierre Fraigniaud Amos Korman M. Parter David Peleg 77 41 0 01 Jul 2012