Pages that link to "Item:Q5395667"
From MaRDI portal
The following pages link to Deterministic Distributed Vertex Coloring in Polylogarithmic Time (Q5395667):
Displaying 13 items.
- Feedback from nature: simple randomised distributed algorithms for maximal independent set selection and greedy colouring (Q518926) (← links)
- Distributed independent sets in interval and segment intersection graphs (Q831804) (← links)
- Distributed algorithms for random graphs (Q888436) (← links)
- Distributed backup placement (Q2084982) (← links)
- Linial for lists (Q2104037) (← links)
- What can be sampled locally? (Q2189170) (← links)
- Locality and checkability in wait-free computing (Q2441537) (← links)
- Distributed Graph Coloring: Fundamentals and Recent Developments (Q4980035) (← links)
- (Q5092346) (← links)
- Distributed $(\Delta+1)$-Coloring via Ultrafast Graph Shattering (Q5112251) (← links)
- Distributed Lower Bounds for Ruling Sets (Q5863326) (← links)
- Making local algorithms wait-free: the case of ring coloring (Q5920224) (← links)
- On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition (Q6098462) (← links)
