Pages that link to "Item:Q1274333"
From MaRDI portal
The following pages link to Near-optimal, distributed edge colouring via the nibble method (Q1274333):
Displaying 11 items.
- Constructing processes with prescribed mixing coefficients (Q956363) (← links)
- Probabilistic recurrence relations revisited (Q1391296) (← links)
- Towards the linear arboricity conjecture (Q1985445) (← links)
- Number of 1-factorizations of regular high-degree graphs (Q2220965) (← links)
- Randomized Δ-edge colouring via exchanges of complex colours (Q2868167) (← links)
- (Probabilistic) recurrence relations revisited (Q5096333) (← links)
- Superfast coloring in CONGEST via efficient color sampling (Q5918634) (← links)
- Distributed algorithms for the Lovász local lemma and graph coloring (Q5920074) (← links)
- Distributed deterministic edge coloring using bounded neighborhood independence (Q5920296) (← links)
- Superfast coloring in CONGEST via efficient color sampling (Q5925614) (← links)
- On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition (Q6098462) (← links)
