Pages that link to "Item:Q5363083"

The following pages link to (2Δ — l)-Edge-Coloring is Much Easier than Maximal Matching in the Distributed Setting (Q5363083):

Displayed 10 items.

• Distributed coloring algorithms for triangle-free graphs (Q2347810) ‎ (← links)
• An Exponential Separation between Randomized and Deterministic Complexity in the LOCAL Model (Q4620411) ‎ (← links)
• (Q5090456) ‎ (← links)
• Distributed $(\Delta+1)$-Coloring via Ultrafast Graph Shattering (Q5112251) ‎ (← links)
• Superfast coloring in CONGEST via efficient color sampling (Q5918634) ‎ (← links)
• Distributed coloring and the local structure of unit-disk graphs (Q5918711) ‎ (← links)
• Distributed algorithms for the Lovász local lemma and graph coloring (Q5920074) ‎ (← links)
• Superfast coloring in CONGEST via efficient color sampling (Q5925614) ‎ (← links)
• (Q6084349) ‎ (← links)
• On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition (Q6098462) ‎ (← links)