On the complexity of distributed graph coloring
Authors:
Open Access
- 23 July 2006
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 7-15
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Distributed approximationACM SIGACT News, 2004
- Zero Knowledge and the Chromatic NumberJournal of Computer and System Sciences, 1998
- Free Bits, PCPs, and Nonapproximability---Towards Tight ResultsSIAM Journal on Computing, 1998
- On the Complexity of Distributed Network DecompositionJournal of Algorithms, 1996
- Low diameter graph decompositionsCombinatorica, 1993
- Locality in Distributed Graph AlgorithmsSIAM Journal on Computing, 1992
- Parallel Symmetry-Breaking in Sparse GraphsSIAM Journal on Discrete Mathematics, 1988
- A fast and simple randomized parallel algorithm for the maximal independent set problemJournal of Algorithms, 1986
- A Simple Parallel Algorithm for the Maximal Independent Set ProblemSIAM Journal on Computing, 1986
- Deterministic coin tossing with applications to optimal parallel list rankingInformation and Control, 1986