MIS in the Congested Clique Model in O(log log Δ) Rounds

arXiv: Distributed, Parallel, and Cluster Computing, Volume abs/1802.07647, 2018.

Cited by: 0|Views14
EI

Abstract:

We give a maximal independent set (MIS) algorithm that runs in $O(log log Delta)$ rounds in the congested clique model, where $Delta$ is the maximum degree of the input graph. This improves upon the $O(frac{log(Delta) cdot log log Delta}{sqrt{log n}} + log log Delta )$ rounds algorithm of [Ghaffari, PODC u002717], where $n$ is the number ...More

Code:

Data:

Get fulltext within 24h
Bibtex
Upload PDF

1.Your uploaded documents will be check within 24h, and coins will be credited to your account.

2.As the current system does not support cash withdrawal, you can add staff WeChat (AMxiaomai) to receive it as a red packet.

3.10 coins will be exchanged for 1 yuan.

?

Upload a single paper

for 5 coins

Wechat's Red Packet
?

Upload 50 articles

for 280 coins

Wechat's Red Packet
?

Upload 200 articles

for 1200 coins

Wechat's Red Packet
?

Upload 500 articles

for 3000 coins

Wechat's Red Packet
?

Upload 1000 articles

for 7000 coins

Wechat's Red Packet
Your rating :
0

 

Tags
Comments