Pages that link to "Item:Q5002850"
From MaRDI portal
The following pages link to (Delta+1) Coloring in the Congested Clique Model (Q5002850):
Displaying 12 items.
- Lessons from the congested clique applied to MapReduce (Q896148) (← links)
- Fast approximate shortest paths in the congested clique (Q2064057) (← links)
- Derandomizing local distributed algorithms under bandwidth restrictions (Q2189176) (← links)
- Simple Distributed Δ + 1 Coloring in the SINR Model (Q3460713) (← links)
- (Q5075750) (← links)
- Randomized (Delta+1)-Coloring in O(log* Delta) Congested Clique Rounds (Q5090932) (← links)
- Distributed $(\Delta+1)$-Coloring via Ultrafast Graph Shattering (Q5112251) (← links)
- Distance-2 Coloring in the CONGEST Model (Q5855241) (← links)
- Simple, Deterministic, Constant-Round Coloring in Congested Clique and MPC (Q5860478) (← links)
- Superfast coloring in CONGEST via efficient color sampling (Q5925614) (← links)
- (Q6084349) (← links)
- Brooks' theorem in graph streams: a single-pass semi-streaming algorithm for \(\Delta\)-coloring (Q6566595) (← links)