Pages that link to "Item:Q5892130"
From MaRDI portal
The following pages link to Distributed algorithms for the Lovász local lemma and graph coloring (Q5892130):
Displaying 6 items.
- Local computation algorithms for graphs of non-constant degrees (Q524360) (← links)
- What can be sampled locally? (Q2189170) (← links)
- Distributed coloring algorithms for triangle-free graphs (Q2347810) (← links)
- On the Lovász Theta Function for Independent Sets in Sparse Graphs (Q4571926) (← links)
- An Exponential Separation between Randomized and Deterministic Complexity in the LOCAL Model (Q4620411) (← links)
- (Q5009540) (← links)
