Deterministic (+1)-coloring in sublinear (in ) time in static, dynamic, and faulty networks
From MaRDI portal
Publication:3177822
Recommendations
- Deterministic \(({\delta} + 1)\)-coloring in sublinear (in \({\delta}\)) time in static, dynamic and faulty networks
- Distributed \((\Delta+1)\)-coloring in linear (in \(\Delta\)) time
- Deterministic distributed vertex coloring in polylogarithmic time
- Deterministic distributed vertex coloring in polylogarithmic time
- Distributed \(({\Delta}+1)\)-coloring in linear (in \({\Delta})\) time
Cited in
(15)- Linial for lists
- Making local algorithms wait-free: the case of ring coloring
- Sublinear algorithms for \((\Delta + 1)\) vertex coloring
- Self-stabilizing \((\varDelta +1)\)-coloring in sublinear (in \(\varDelta\)) rounds via locally-iterative algorithms
- Resource efficient stabilization for local tasks despite unknown capacity links
- Distributed \((\Delta+1)\)-coloring via ultrafast graph shattering
- Distributed coloring of hypergraphs
- Deterministic \(({\delta} + 1)\)-coloring in sublinear (in \({\delta}\)) time in static, dynamic and faulty networks
- Almost global problems in the LOCAL model
- Improved distributed algorithms for coloring interval graphs with application to multicoloring trees
- Improved dynamic colouring of sparse graphs
- What can be sampled locally?
- Local conflict coloring revisited: Linial for lists
- Almost global problems in the LOCAL model
- Local mending
This page was built for publication: Deterministic \((\Delta+1)\)-coloring in sublinear (in \(\Delta\)) time in static, dynamic, and faulty networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3177822)
