Pages that link to "Item:Q5361852"
From MaRDI portal
The following pages link to Distributed (∆+1)-coloring in sublogarithmic rounds (Q5361852):
Displaying 12 items.
- Best of two local models: centralized local and distributed local algorithms (Q1784947) (← links)
- Improved distributed \(\Delta\)-coloring (Q1981630) (← links)
- What can be sampled locally? (Q2189170) (← links)
- Improved deterministic distributed matching via rounding (Q2189173) (← links)
- Distributed coloring in sparse graphs with fewer colors (Q2335690) (← links)
- Distributed Spanner Approximation (Q4997324) (← links)
- (Delta+1) Coloring in the Congested Clique Model (Q5002850) (← links)
- (Q5075750) (← links)
- Randomized (Delta+1)-Coloring in O(log* Delta) Congested Clique Rounds (Q5090932) (← links)
- Distributed Minimum Vertex Coloring and Maximum Independent Set in Chordal Graphs (Q5092380) (← links)
- Node and edge averaged complexities of local graph problems (Q6071120) (← links)
- (Q6084349) (← links)
