×

\(1\)-local \(7/5\)-competitive algorithm for multicoloring hexagonal graphs. (English) Zbl 1236.05198

Haouari, M. (ed.) et al., ISCO 2010. International symposium on combinatorial optimization. Papers based on the presentations at the symposium, Hammamet, Tunesia, March 24–26, 2010. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 36, 375-382 (2010).
Summary: Hexagonal graphs are graphs induced on subsets of vertices of triangular lattice. They arise naturally in studies of cellular networks. We present a \(1\)-local \(7/5\)-competitive distributed algorithm for multicoloring a hexagonal graph, thereby improving the previous \(1\)-local \(17/12\)-competitive algorithm.
For the entire collection see [Zbl 1236.90011].

MSC:

05C85 Graph algorithms (graph-theoretic aspects)
05C15 Coloring of graphs and hypergraphs
05C90 Applications of graph theory
92E10 Molecular structure (graph-theoretic methods, methods of differential topology, etc.)
Full Text: DOI

References:

[1] Chin, F. Y.L.; Zhang, Y.; Zhu, H., A 1-local 13/9-competitive Algorithm for Multicoloring Hexagonal Graphs, Algorithmica, 54, 557-567 (2009) · Zbl 1177.68246
[2] Hale, W. K., Frequency assignment: theory and applications, Proceedings of the IEEE, 68, 12, 1497-1514 (1980)
[3] Janssen, J.; Krizanc, D.; Narayanan, L.; Shende, S., Distributed Online Frequency Assignment in Cellular Network, Journal of Algorithms, 36, 2, 119-151 (2000) · Zbl 0957.68007
[4] McDiarmid, C.; Reed, B., Channel assignment and weighted coloring, Networks, 36, 2, 114-117 (2000) · Zbl 0971.90100
[5] Narayanan, L.; Shende, S. M., Static frequency assignment in cellular networks, Algorithmica, 29, 3, 396-409 (2001) · Zbl 0969.68011
[6] Šparl, P.; Žerovnik, J., 2-local 4/3-competitive Algorithm for Multicoloring Hexagonal Graphs, Journal of Algorithms, 55, 1, 29-41 (2005) · Zbl 1068.68168
[7] Sudeep, K. S.; Vishwanathan, S., A technique for multicoloring triangle-free hexagonal graphs, Discrete Mathematics, 300, 256-259 (2005) · Zbl 1076.05037
[8] Witkowski, R., A 1-local 17/12-competitive Algorithm for Multicoloring Hexagonal Graphs, Lecture Notes of Computer Science, vol. 5699/2009 (2009), pp. 346-356 · Zbl 1252.68215
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.