A. Mashreghi

collaborators

2 papers

cs.DC2019

Faster asynchronous MST and low diameter tree construction with sublinear communication

Ali Mashreghi, Valerie King

Building a spanning tree, minimum spanning tree (MST), and BFS tree in a distributed network are fundamental problems which are still not fully understood in terms of time and comm…

cs.DC2018

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

Ali Mashreghi, Valerie King

We provide the first asynchronous distributed algorithms to compute broadcast and minimum spanning tree with $o (m)$ bits of communication, in a graph with $n$ nodes and $m$ edges.…

Faster asynchronous MST and low diameter tree construction with sublinear communication

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

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