Adaptive massively parallel coloring in sparse graphs
From MaRDI portal
Cites work
- Adaptive massively parallel coloring in sparse graphs
- An optimal distributed (+1)-coloring algorithm?
- Decomposition of Finite Graphs Into Forests
- Deterministic \(({\delta} + 1)\)-coloring in sublinear (in \({\delta}\)) time in static, dynamic and faulty networks
- Deterministic distributed vertex coloring in polylogarithmic time
- Distributed arboricity-dependent graph coloring via all-to-all communication
- Distributed Graph Coloring: Fundamentals and Recent Developments
- Fully-dynamic + 2 Arboricity decompositions and implicit colouring
- Graph coloring via degeneracy in streaming and other space-conscious models
- scientific article; zbMATH DE number 7829315 (Why is no real title available?)
- Improved Deterministic (Δ+1) Coloring in Low-Space MPC
- Improved dynamic colouring of sparse graphs
- Linial for lists
- Local conflict coloring
- Locality in Distributed Graph Algorithms
- On the locality of Nash-Williams forest decomposition and star-forest decomposition
- Seeing Far vs. Seeing Wide: Volume Complexity of Local Graph Problems
- Simple and near-optimal distributed coloring for sparse graphs
- Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition
- The Complexity of (Δ+1) Coloring in Congested Clique, Massively Parallel Computation, and Centralized Local Computation
This page was built for publication: Adaptive massively parallel coloring in sparse graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6971907)
