Distributed graph coloring in a few rounds
From MaRDI portal
Publication:2943379
Recommendations
Cites work
- scientific article; zbMATH DE number 795590 (Why is no real title available?)
- Almost-Everywhere Secure Computation
- Broadcasting in dynamic radio networks
- Consensus algorithms with one-bit messages
- Continuous consensus via common knowledge
- Distributed computation in dynamic networks
- Fault Tolerance in Networks of Bounded Degree
- Flooding time in edge-Markovian dynamic graphs
- Gradient clock synchronization in dynamic networks
- How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs)
- Knowledge and common knowledge in a Byzantine environment: Crash failures
- Knowledge and common knowledge in a distributed environment
- Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony
- Optimal gradient clock synchronization in dynamic networks
- Parsimonious flooding in dynamic graphs
- Perfectly secure message transmission
- Programming simultaneous actions using common knowledge
- Reaching Agreement in the Presence of Faults
Cited in
(9)- Simple and near-optimal distributed coloring for sparse graphs
- Distributed algorithms for fractional coloring
- Distributed coloring in sparse graphs with fewer colors
- Design patterns in beeping algorithms: examples, emulation, and analysis
- Exact bounds for distributed graph colouring
- Faster Deterministic Distributed Coloring Through Recursive List Coloring
- Distributed Coloring in Sparse Graphs with Fewer Colors
- Randomised distributed MIS and colouring algorithms for rings with oriented edges in \(O(\sqrt{\log n})\) bit rounds
- Fast Distributed Algorithms for Brooks–Vizing Colorings
This page was built for publication: Distributed graph coloring in a few rounds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2943379)