2-local <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:mn>4</mml:mn><mml:mo stretchy="false">/</mml:mo><mml:mn>3</mml:mn></mml:math>-competitive algorithm for multicoloring hexagonal graphs

DOI10.1016/j.jalgor.2004.09.001zbMath1068.68168OpenAlexW1998757084MaRDI QIDQ4675487

Janez Žerovnik, Petra Šparl

Publication date: 4 May 2005

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jalgor.2004.09.001

zbMATH Keywords

Cellular networksGraph coloring2-local distributed algorithmFrequency planning

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10)

Related Items

1-local 7/5-competitive Algorithm for Multicoloring Hexagonal Graphs ⋮ Online Multi-Coloring with Advice ⋮ Online multi-coloring on the path revisited ⋮ 1-local 7/5-competitive algorithm for multicoloring hexagonal graphs ⋮ A linear time algorithm for \(7\)-\([3\)coloring triangle-free hexagonal graphs] ⋮ Analysing local algorithms in location-aware quasi-unit-disk graphs ⋮ Simpler multicoloring of triangle-free hexagonal graphs ⋮ A 1-local 4/3-competitive algorithm for multicoloring a subclass of hexagonal graphs ⋮ 2-local 7/6-competitive algorithm for multicolouring a sub-class of hexagonal graphs ⋮ Absolute and asymptotic bounds for online frequency allocation in cellular networks ⋮ A 1-local asymptotic 13/9-competitive algorithm for multicoloring hexagonal graphs ⋮ 2-local distributed algorithms for generalized coloring of hexagonal graphs ⋮ Online multi-coloring with advice