Pages that link to "Item:Q2796270"
From MaRDI portal
The following pages link to Deterministic (Δ + 1)-Coloring in Sublinear (in Δ) Time in Static, Dynamic and Faulty Networks (Q2796270):
Displaying 8 items.
- A fast network-decomposition algorithm and its applications to constant-time distributed computation (Q1625605) (← links)
- Derandomizing local distributed algorithms under bandwidth restrictions (Q2189176) (← links)
- Distributed Graph Coloring: Fundamentals and Recent Developments (Q4980035) (← links)
- Fast Distributed Approximation for Max-Cut (Q5056049) (← links)
- Distributed Recoloring (Q5090902) (← links)
- Distributed Minimum Vertex Coloring and Maximum Independent Set in Chordal Graphs (Q5092380) (← links)
- Distributed $(\Delta+1)$-Coloring via Ultrafast Graph Shattering (Q5112251) (← links)
- Coloring fast without learning your neighbors' colors (Q6535038) (← links)
