On the complexity of distributed graph coloring

@inproceedings{Kuhn2006OnTC,
  title={On the complexity of distributed graph coloring},
  author={F. Kuhn and Roger Wattenhofer},
  booktitle={PODC '06},
  year={2006}
}
  • F. Kuhn, Roger Wattenhofer
  • Published in PODC '06 2006
  • Mathematics, Computer Science
  • Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a distributed setting. Processors of a distributed system are nodes of an undirected graph <i>G</i>. There is an edge between two nodes whenever the corresponding processors can directly communicate with each other. We assume that distributed coloring algorithms start with an initial <i>m</i>-coloring of <i>G</i>. In the… CONTINUE READING
    Weak graph colorings: distributed algorithms and applications
    • F. Kuhn
    • Mathematics, Computer Science
    • 2009
    110
    Combinatorial Algorithms for Distributed Graph Coloring
    5
    Distributed Generalized Graph Coloring
    12
    On the complexity of distributed graph coloring with local minimality constraints
    18

    References

    Publications referenced by this paper.
    SHOWING 1-3 OF 3 REFERENCES
    Locality in Distributed Graph Algorithms
    757
    Network decomposition and locality in distributed computation
    263
    Parallel Symmetry-Breaking in Sparse Graphs
    156