David A. Grable, Alessandro Panconesi  Home/Search
Context
Related
| cs.unibo.it/~pancones/joa.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cs.unibo.it/~pancones/papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Let G be a \Delta--regular graph with n vertices and girth at least 4 such that \Delta AE log n. We give very simple, randomized, distributed algorithms for vertex colouring G with \Delta=k colours in O(k + log n= log \Delta) communication rounds, for k = O(log \Delta). The algorithm may fail or exceed the above running time, but the probability that this happens is o(1), a quantity that goes to zero as n grows. The probabilistic analysis relies on a powerful generalization of Azuma's... (Update)
Similar documents (at the sentence level):
25.7%: Fast Distributed Algorithms Brooks-Vizing Colourings - Hanckowiak, Karonski.. (1997) (Correct)
24.4%: Fast Distributed Algorithms for Brooks-Vizing Colourings.. - Grable, Panconesi (Correct)
6.4%: Near-Optimal, Distributed Edge Colouring via the Nibble.. - Dubhashi, Grable, Panconesi (1997) (Correct)
Active bibliography (related documents): More All
1.0: On the Distributed Complexity of Computing Maximal.. - Hanckowiak, Karonski.. (2001) (Correct)
0.8: A Faster Distributed Algorithm for Computing Maximal.. - Hanckowiak, al. (1999) (Correct)
0.6: Nearly optimal distributed edge colouring in O(log log n) rounds - Grable, Panconesi (1997) (Correct)
Similar documents based on text: More All
0.2: Essentially Infinite Colourings Of Graphs - Bollobás, Kohayakawa.. (Correct)
0.2: Some Simple Distributed Algorithms for Sparse Networks - Panconesi, Rizzi (2000) (Correct)
0.1: Acyclic Improper Colourings of Graphs with Bounded Degree - Boiron, al. (1997) (Correct)
BibTeX entry: (Update)
@inproceedings{ grable98fast,
author = "Grable and Panconesi",
title = "Fast Distributed Algorithms for Brooks-Vizing Colourings",
booktitle = "{SODA}: {ACM}-{SIAM} Symposium on Discrete Algorithms (A Conference on Theoretical and Experimental Analysis of Discrete Algorithms)",
year = "1998",
url = "citeseer.ist.psu.edu/409162.html" }
Citations (may not include all citations):837 Cambridge University Press (context) - Motwani, Raghavan et al. - 1995
123 the method of bounded differences (context) - McDiarmid - 1989
40 Network decomposition and locality in distributed computing - Awerbuch, Goldberg et al. - 1989
40 Probabilistic recurrence relations (context) - Karp
33 Probability theory and combinatorial optimization (context) - Steele
29 Springer Verlag (context) - Bollob'as, Theory - 1979
21 Wiley--Interscience Series (context) - Alon, Spencer et al. - 1992
17 Theoretical Computer Science (context) - Karloff, for et al. - 1989
17 On Brooks' Theorem for sparse graphs (context) - Kim - 1995
11 Asymptotic choice number for triangle-free graphs (context) - Johansson - 1996
10 the complexity of distributed network decomposition (context) - Panconesi, Srinivasan - 1996
9 Removing randomness in parallel without processor penalty (context) - Luby - 1993
9 Nearly optimal distributed edge colouring in O (context) - Grable, Panconesi - 1997
8 A large deviation inequality for functions of independent (context) - Grable - 1998
8 Delta-coloring and its algorithmic applications (context) - Panconesi, Srinivasan et al. - 1995
7 Probabilistic recurrence relations revisited - Chaudhuri, Dubhashi
7 Personal communication (context) - Johansson - 1997
7 Brooks coloring in parallel (context) - Hajnal, Szemer'edi - 1990
6 and maximal degree (context) - Bollob'as, number - 1978
4 On random greedy triangle packing - Grable - 1997
4 Concentration of Measure for Computer Scientist (context) - Dubhashi, Panconesi
3 A faster parallel algorithm to color a graph with \Delta col.. (context) - Karchmer, Naor - 1988
2 distributed edge-colouring via the nibble method (context) - Dubhashi, Grable et al.
Documents on the same site (http://www.cs.unibo.it/~pancones/papers.html): More
A Faster Distributed Algorithm for Computing Maximal.. - Hanckowiak, al. (1999) (Correct)
On the Importance of Having an Identity or, is.. - Buhrmann.. (Correct)
Concentration of Measure for the Analysis of Randomised.. - Dubhashi, Panconesi (1998) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC