2-local 7/6-competitive algorithm for multicolouring a sub-class of hexagonal graphs
From MaRDI portal
Publication:5747734
DOI10.1080/00207160802562531zbMath1221.05296OpenAlexW2022533173MaRDI QIDQ5747734
Publication date: 14 September 2010
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160802562531
approximation algorithmgraph colouringcellular networksfrequency planning2-local distributed algorithm
Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Distributed algorithms (68W15)
Related Items
A linear time algorithm for \(7\)-\([3\)coloring triangle-free hexagonal graphs] ⋮ Simpler multicoloring of triangle-free hexagonal graphs ⋮ A 1-local 4/3-competitive algorithm for multicoloring a subclass of hexagonal graphs
Cites Work
- Corrigendum: Static frequency assignment in cellular networks
- Finding a five bicolouring of a triangle-free subgraph of the triangular lattice
- 2-local 5/4-competitive algorithm for multicoloring triangle-free hexagonal graphs
- A technique for multicoloring triangle-free hexagonal graphs
- Distributed Online Frequency Assignment in Cellular Networks
- Channel assignment and weighted coloring
- 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
- Static frequency assignment in cellular networks
- Channel assignment and multicolouring of the induced subgraphs of the triangular lattice
