Pages that link to "Item:Q5230309"
From MaRDI portal
The following pages link to An optimal distributed (Δ+1)-coloring algorithm? (Q5230309):
Displaying 20 items.
- Improved distributed \(\Delta\)-coloring (Q1981630) (← links)
- Linial for lists (Q2104037) (← links)
- Distributed coloring in sparse graphs with fewer colors (Q2335690) (← links)
- Distributed minimum vertex coloring and maximum independent set in chordal graphs (Q2672608) (← links)
- An Exponential Separation between Randomized and Deterministic Complexity in the LOCAL Model (Q4620411) (← links)
- Distributed Spanner Approximation (Q4997324) (← links)
- (Q5090456) (← links)
- Distributed Recoloring (Q5090902) (← links)
- Randomized (Delta+1)-Coloring in O(log* Delta) Congested Clique Rounds (Q5090932) (← links)
- (Q5092346) (← links)
- Distributed Minimum Vertex Coloring and Maximum Independent Set in Chordal Graphs (Q5092380) (← links)
- Network Decomposition and Distributed Derandomization (Invited Paper) (Q5100942) (← links)
- Distributed $(\Delta+1)$-Coloring via Ultrafast Graph Shattering (Q5112251) (← links)
- Simple, Deterministic, Constant-Round Coloring in Congested Clique and MPC (Q5860478) (← links)
- Distributed Lower Bounds for Ruling Sets (Q5863326) (← links)
- A topological perspective on distributed network algorithms (Q5919043) (← 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)
- (Q6084349) (← links)
- A note on the network coloring game: a randomized distributed \((\Delta+1)\)-coloring algorithm (Q6161445) (← links)
