Fast Distributed Algorithms for Brooks–Vizing Colorings

Let G be a Δ-regular graph with n vertices and girth at least 4 such that Δ⪢logn. We give very simple, randomized, distributed algorithms for vertex coloring G with Δ/k colors in O(k+logn) communication rounds, where k=O(logΔ). The algorithm may fail or exceed the above running time, but the probabi...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of algorithms Vol. 37; no. 1; pp. 85 - 120
Main Authors:	Grable, David A, Panconesi, Alessandro
Format:	Journal Article Conference Proceeding
Language:	English
Published:	San Diego, CA Elsevier Inc 01.10.2000 Elsevier
Subjects:	Algorithmics. Computability. Computer arithmetics Applied sciences Combinatorics Combinatorics. Ordered structures Computer science; control theory; systems Exact sciences and technology Graph theory Mathematics Sciences and techniques of general use Theoretical computing Bounded variance method Randomization Brooks Vizing like problem Distributed algorithm Graph colouring Graph theory Complexity measure Bounded solution Azuma martingale inequality
ISSN:	0196-6774, 1090-2678
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!