2-local distributed algorithms for generalized coloring of hexagonal graphs

Electronic Notes in Discrete Mathematics

Volumn 22, Issue , 2005, Pages 321-325

  Šparl, Petra ^a   Žerovnik, Janez ^a  

^a UNIVERSITY OF MARIBOR   (Slovenia)

Author keywords

approximation algorithm; frequency planning; graph coloring; k local distributed algorithm

Indexed keywords

EID: 34247101859     PISSN: 15710653     EISSN: 15710653     Source Type: Journal    
DOI: 10.1016/j.endm.2005.06.042     Document Type: Article

References (8)

1. Havet F. Channel assignment and multicoloring of the induced subgraphs of the triangular lattice. Discrete Math. 233 (2001) 219-231
2. Havet F., and Žerovnik J. Finding a five bicolouring of a triangle-free subgraph of the triangular lattice. Discrete Math. 244 (2002) 103-108
3. Janssen J., Krizanc D., Narayanan L., and Shende S. Distributed online frequency assignment in cellular networks. J. Algorithms 36 (2000) 119-151
4. McDiarmid C., and Reed B. Channel assignment and weighted colouring. Networks supplement 36 (2000) 114-117
5. Šparl P., and Žerovnik J. 2-local 5/4-competitive algorithm for multicoloring triangle-free hexagonal graphs. Inform. Process. Lett. 90 (2004) 239-246
6. Šparl P., and Žerovnik J. 2-local 4/3-competitive algorithm for multicoloring hexagonal graphs. J. Algorithms 55 (2005) 29-41
7. P. Šparl and J. Žerovnik, 3-local 7/6-competitive algorithm for multicoloring a sub-class of hexagonal graphs, In preparation
8. J. Žerovnik, A distributed 6/5-competitive algorithm for multicoloring triangle-free hexagonal graphs, Preprint series-University of Ljubljana, Institute of Mathematics, 42 (2004) No. 954, 1-12