Fast distributed Brooks' theorem
From MaRDI portal
Cited in
(6)- Brooks' theorem in graph streams: a single-pass semi-streaming algorithm for \(\Delta\)-coloring
- Simple sublinear algorithms for (+1) vertex coloring via asymmetric palette sparsification
- Distributed symmetry breaking on power graphs via sparsification
- Parallel derandomization for coloring
- Optimal (degree+1)-coloring in congested clique
- Min-Max correlation clustering via neighborhood similarity
This page was built for publication: Fast distributed Brooks' theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6538628)