Pages that link to "Item:Q5361852"
From MaRDI portal
The following pages link to Distributed (∆+1)-coloring in sublogarithmic rounds (Q5361852):
Displaying 9 items.
- Best of two local models: centralized local and distributed local algorithms (Q1784947) (← links)
- Improved distributed \(\Delta\)-coloring (Q1981630) (← 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)
- Distributed Minimum Vertex Coloring and Maximum Independent Set in Chordal Graphs (Q5092380) (← links)
- Improved distributed algorithms for coloring interval graphs with application to multicoloring trees (Q5919420) (← links)
- Node and edge averaged complexities of local graph problems (Q6071120) (← links)
- Improved dynamic colouring of sparse graphs (Q6499298) (← links)
