Pages that link to "Item:Q5230307"
From MaRDI portal
The following pages link to Deterministic distributed edge-coloring with fewer colors (Q5230307):
Displaying 17 items.
- Near-optimal, distributed edge colouring via the nibble method (Q1274333) (← links)
- Linial for lists (Q2104037) (← links)
- Improved distributed degree splitting and edge coloring (Q2189174) (← links)
- A fast distributed algorithm for \((\Delta+1)\)-edge-coloring (Q2664558) (← links)
- (Q4608064) (← links)
- Network Decomposition and Distributed Derandomization (Invited Paper) (Q5100942) (← links)
- Distributed Local Approximation Algorithms for Maximum Matching in Graphs and Hypergraphs (Q5115699) (← links)
- Deterministic distributed vertex coloring in polylogarithmic time (Q5176216) (← links)
- Distributed Coloring in Sparse Graphs with Fewer Colors (Q5197707) (← links)
- Deterministic Distributed (Delta + o(Delta))-Edge-Coloring, and Vertex-Coloring of Graphs with Bounded Diversity (Q5368959) (← links)
- Distributed deterministic edge coloring using bounded neighborhood independence (Q5892122) (← links)
- Distributed deterministic edge coloring using bounded neighborhood independence (Q5920296) (← links)
- On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition (Q6098462) (← links)
- Near-optimal distributed edge coloring (Q6102321) (← links)
- Improved distributed degree splitting and edge coloring (Q6487490) (← links)
- Local conflict coloring revisited: Linial for lists (Q6535013) (← links)
- Borel Vizing's theorem for graphs of subexponential growth (Q6654016) (← links)