Weak graph colorings: distributed algorithms and applications

@inproceedings{Kuhn2009WeakGC,
  title={Weak graph colorings: distributed algorithms and applications},
  author={F. Kuhn},
  booktitle={SPAA '09},
  year={2009}
}
  • F. Kuhn
  • Published in SPAA '09 2009
  • Mathematics, Computer Science
  • We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a color class may induce a graph of maximum degree d for some parameter d>0. We also look at colorings where a minimum number of multi-chromatic edges is required. For an integer k>0, we call a coloring k-partially proper if every node v has at least min{k,deg(v)} neighbors with a different color. We show that for all d∈{1… CONTINUE READING
    Local Conflict Coloring
    • 85
    • Highly Influenced
    • PDF
    Distributed (δ+1)-coloring in linear (in δ) time
    • 131
    • PDF
    Distributed coloring algorithms for triangle-free graphs
    • 36
    • PDF
    The Locality of Distributed Symmetry Breaking
    • 187
    • PDF
    Ordering heuristics for parallel graph coloring
    • 53
    • PDF
    A new technique for distributed symmetry breaking
    • 88
    • Highly Influenced
    • PDF
    Distributed deterministic edge coloring using bounded neighborhood independence
    • 27
    • Highly Influenced
    • PDF

    References

    Publications referenced by this paper.
    SHOWING 1-4 OF 4 REFERENCES
    Locality in Distributed Graph Algorithms
    • 778
    • Highly Influential
    • PDF
    Distributed (δ+1)-coloring in linear (in δ) time
    • 131
    • Highly Influential
    • PDF
    What can be computed locally?
    • 160
    • Highly Influential
    • PDF
    A simple parallel algorithm for the maximal independent set problem
    • 1,076
    • Highly Influential
    • PDF