Pages that link to "Item:Q2664558"
From MaRDI portal
The following pages link to A fast distributed algorithm for \((\Delta+1)\)-edge-coloring (Q2664558):
Displaying 12 items.
- Randomised distributed MIS and colouring algorithms for rings with oriented edges in \(O(\sqrt{\log n})\) bit rounds (Q342718) (← links)
- A self-stabilizing \((\Delta +4)\)-edge-coloring algorithm for planar graphs in anonymous uniform systems (Q845924) (← links)
- 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 parallel algorithm to color a graph with Δ colors (Q3792256) (← links)
- (Q4608064) (← links)
- Faster Deterministic Distributed Coloring Through Recursive List Coloring (Q5146848) (← links)
- Deterministic distributed edge-coloring with fewer colors (Q5230307) (← links)
- Brooks’ theorem in graph streams: a single-pass semi-streaming algorithm for ∆-coloring (Q6083481) (← links)
- On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition (Q6098462) (← links)
- Borel Vizing's theorem for graphs of subexponential growth (Q6654016) (← links)