D. Dubhashi, D. Grable and A. Panconesi, Nearly-optimal, distributed edge-colouring via the nibble method, Theoretical Computer Science 203 (1998) 225--251, a special issue for ESA95, the 3rd European Symposium on Algorithms (ESA 95). Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
An Experimental Study of a Simple, Distributed Edge.. - Marathe, Panconesi.. (1999) (1 citation) Self-citation (Panconesi) (Correct)
....work. The problem of finding efficient edge colorings of a graph has been a subject of active research over the last three decades. Numerous papers have 3 been published on this topic ranging from optimal sequential algorithms to randomized distributed algorithms. We refer the reader to [14, 12, 22, 6, 16, 17, 7, 11] and the references therein. We note that the given a graph with maximum degree Delta, several sequential algorithms can provide solutions that color the graph using no more than Delta 1 colors. In contrast, obtaining such tight bounds in NC or under the distributed computing model is still an ....
D. Dubhashi, D. Grable and A. Panconesi, Nearly-optimal, distributed edge-colouring via the nibble method, Theoretical Computer Science 203 (1998) 225--251, a special issue for ESA95, the 3rd European Symposium on Algorithms (ESA 95).
Fast Distributed Algorithms for Brooks-Vizing Colourings - Grable, Panconesi Self-citation (Grable Panconesi) (Correct)
....relies on large deviation inequalities that cease to give strong enough bounds for lower values of Delta. The probabilistic analysis makes use of a powerful generalization of Azuma s inequality, described and commented upon in Section 3, that is very well suited for the analysis of algorithms [8, 10, 6, 7]. Although we stated our result in its most general form, for brevity s sake, we shall actually present a slightly weaker version. Namely, we shall show that the above statement holds with the running time replaced by O(k log n) 2 Preliminaries We shall make use of the following definitions, ....
.... genesis of the method and the proofs, see [8] For an introduction to the area of concentration of measure and a comparative analysis of the various existing methods, including recent ones such as Talagrand s inequalities, see [7, 23] For applications of the mobv to the analysis of algorithms see [6, 8, 10] and, obviosuly, the present paper In order to make the paper as self contained as possible we now describe the mobv. Assume we have a probability space generated by independent random variables X i (choices) where choice X i is from the finite set A i , and a function Y = f(X 1 ; X n ) ....
[Article contains additional citation context not shown here]
D. Dubhashi, D.A. Grable and A. Panconesi, Nearly-optimal, distributed edge-colouring via the nibble method. Special issue of Theoretical Computer Science for ESA95, the 3rd European Symposium on Algorithms (ESA 95). To appear.
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