Simple distributed Δ+1-coloring of graphs

Information Processing Letters

Volumn 70, Issue 5, 1999, Pages 229-232

  Johansson, Öjvind ^a  

^a ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DISTRIBUTED COMPUTER SYSTEMS; MATHEMATICAL MODELS; RANDOM PROCESSES; SET THEORY; THEOREM PROVING;

VERTEX COLORING ALGORITHMS;

GRAPH THEORY;

EID: 0033591579     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(99)00064-2     Document Type: Article

References (5)

1. D.A. Grable, A. Panconesi, Fast distributed algorithms for Brooks-Vizing colourings, In: Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998, pp. 473-480.
2. R.M. Karp, Probabilistic recurrence relations, In: Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1991, pp. 190-197.
3. R.M. Karp, Probabilistic recurrence relations, J. ACM 41 (1994) 1136-1150.
4. M. Luby, Removing randomness in parallel computation without a processor penalty, J. Computer System Sci. 47 (1993) 250-286.
5. A. Panconesi, A. Srinivasan, On the complexity of distributed network decomposition, J. Algorithms 20 (1996) 356-374.