A better practical algorithm for distributed graph coloring

Proceedings - International Conference on Parallel Computing in Electrical Engineering, PARELEC 2002

Volumn , Issue , 2002, Pages 72-75

  Kubale, M ^a   Kuszner, L ^a  

^a GDANSK UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

Bidirectional control; Color; Distributed algorithms; Informatics; Law; Legal factors; Paper technology; Parallel processing; Spread spectrum communication; Wireless networks

Indexed keywords

COLOR; GRAPH THEORY; PARALLEL ALGORITHMS; SPREAD SPECTRUM COMMUNICATION; WIRELESS NETWORKS;

INFORMATICS; LAW; LEGAL FACTORS; PAPER TECHNOLOGY; PARALLEL PROCESSING;

ALGORITHMS;

EID: 33750016922     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/PCEE.2002.1115204     Document Type: Conference Paper

References (6)

1. R. Battiti, A. A. Bertossi, and M. A. Bonuccelli. Assigning codes in wireless networks. Wireless Networks, 5:195-209, 1999.
2. D. A. Grable and A. Panconesi. Fast distributed algorithms for Brooks-Vizing colorings. J. Algorithms, 37(1):85-120, 2000.
3. O. Johansson. Simple distributed-+1-coloring of graphs. Information Processing Letters, 70:229-232, 1999.
4. D. S. Johnson. Worst case behavior of graph coloring algorithms. In Proc. 5-th Southeastern Conf. on Combinatorics, Graph Theory and Computing, pages 513-527, 1974.
5. R. M. Karp. Probabilistic recurence relations. Journal of ACM, 41:1136-1150, 1994.
6. M. Kubale. Introduction to Computational Complexity and Algorithmic Graph Coloring. GTN,Gdánsk, 1998.