2-local distributed algorithms for generalized coloring of hexagonal graphs

doi:10.1016/j.endm.2005.06.042

Electronic Notes in Discrete Mathematics

Volume 22, 15 October 2005, Pages 321-325

https://doi.org/10.1016/j.endm.2005.06.042 Get rights and content

Abstract

A 2-local distributed approximation algorithm for multicoloring of a triangle-free hexagonal graph which uses at most $⌈ (5 / 4) ω (G) ⌉ + 3$ colors is presented.

References (8)

F. Havet
Channel assignment and multicoloring of the induced subgraphs of the triangular lattice
Discrete Math.
(2001)
F. Havet et al.
Finding a five bicolouring of a triangle-free subgraph of the triangular lattice
Discrete Math.
(2002)
J. Janssen et al.
Distributed online frequency assignment in cellular networks
J. Algorithms
(2000)
P. Šparl et al.
2-local 5/4-competitive algorithm for multicoloring triangle-free hexagonal graphs
Inform. Process. Lett.
(2004)

There are more references available in the full text version of this article.

Cited by (4)

Efficient self-stabilizing grundy coloring algorithms
2017, FTC 2016 - Proceedings of Future Technologies Conference
A fully dynamic distributed algorithm for a b-coloring of graphs
2008, Proceedings of the 2008 International Symposium on Parallel and Distributed Processing with Applications, ISPA 2008
An incremental distributed algorithm for a partial grundy coloring of graphs
2007, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
A distributed algorithm for a b-coloring of a graph
2006, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

¹: This work was partially supported by the Ministry of higher education, science and technology.

View full text

2-local distributed algorithms for generalized coloring of hexagonal graphs

Abstract

Discrete Math.

Discrete Math.

J. Algorithms

Inform. Process. Lett.