Broadcast and minimum spanning tree with $o(m)$ messages in the asynchronous CONGEST model

12 June 2018

Papers citing "Broadcast and minimum spanning tree with $o(m)$ messages in the asynchronous CONGEST model"

4 / 4 papers shown

Title
Faster asynchronous MST and low diameter tree construction with sublinear communication A. Mashreghi Valerie King 41 12 0 28 Jul 2019
Construction and impromptu repair of an MST in a distributed network with o(m) communication Valerie King S. Kutten M. Thorup LRM 74 60 0 11 Feb 2015
A Fast Distributed Approximation Algorithm for Minimum Spanning Trees in the SINR Model Maleq Khan V. S. Anil Kumar Gopal Pandurangan Guanhong Pei 125 109 0 06 Jun 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 85 347 0 12 Nov 2010