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.001zbMATH Open1068.68168OpenAlexW1998757084MaRDI QIDQ4675487FDOQ4675487

Authors: 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

Recommendations

• 2-local 5/4-competitive algorithm for multicoloring triangle-free hexagonal graphs
• 2-local 7/6-competitive algorithm for multicolouring a sub-class of hexagonal graphs
• A distributed \(6/5\)-competitive algorithm for multicoloring triangle-free hexagonal graphs
• 1-local 33/24-competitive algorithm for multicoloring hexagonal graphs
• 1-Local 33/24-Competitive Algorithm for Multicoloring Hexagonal Graphs

zbMATH Keywords

Cellular networksGraph coloring2-local distributed algorithmFrequency planning

Mathematics Subject Classification ID

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

Cited In (20)

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

This page was built for publication: 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4675487)