2-local 5/4-competitive algorithm for multicoloring triangle-free hexagonal graphs

DOI10.1016/J.IPL.2004.02.017MaRDI QIDQ2390258zbMATH OpenOpenAlexFDO

Authors Petra Šparl, Janez Žerovnik

Publication date 21 July 2009

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2004.02.017

zbMATH Keywords

2-local distributed algorithmsapproximation algorithmscellular networksfrequency planninggraph algorithmsgraph coloring

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15) Approximation algorithms (68W25)

Recommendations

• A distributed \(6/5\)-competitive algorithm for multicoloring triangle-free hexagonal graphs
• 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
• 2-local 7/6-competitive algorithm for multicolouring a sub-class of hexagonal graphs
• A 1-Local 13/9-Competitive Algorithm for Multicoloring Hexagonal Graphs
• 1-local 33/24-competitive algorithm for multicoloring hexagonal graphs

Cites work

• Channel assignment and multicolouring of the induced subgraphs of the triangular lattice
• Channel assignment and weighted coloring
• Corrigendum: Static frequency assignment in cellular networks
• Distributed Online Frequency Assignment in Cellular Networks
• Finding a five bicolouring of a triangle-free subgraph of the triangular lattice
• scientific article; zbMATH DE number 1990841 (Why is no real title available?)
• Static frequency assignment in cellular networks

Cited in

(16)

• A 1-local asymptotic 13/9-competitive algorithm for multicoloring hexagonal graphs
• Finding a five bicolouring of a triangle-free subgraph of the triangular lattice
• 1-local 7/5-competitive algorithm for multicoloring hexagonal graphs
• A technique for multicoloring triangle-free hexagonal graphs
• 1-local 7/5-competitive algorithm for multicoloring hexagonal graphs
• 1-Local 33/24-Competitive Algorithm for Multicoloring Hexagonal Graphs
• 2-local distributed algorithms for generalized coloring of hexagonal graphs
• A 1-Local 13/9-Competitive Algorithm for Multicoloring Hexagonal Graphs
• A linear time algorithm for \(7\)-\([3]\)coloring triangle-free hexagonal graphs
• 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
• A distributed \(6/5\)-competitive algorithm for multicoloring triangle-free hexagonal graphs
• Experimental and Efficient Algorithms
• 2-local 7/6-competitive algorithm for multicolouring a sub-class of hexagonal graphs
• On the packing chromatic number of Cartesian products, hexagonal lattice, and trees
• On the packing chromatic number of Cartesian products, hexagonal lattice, and trees
• Simpler multicoloring of triangle-free hexagonal graphs

This page was built for publication: 2-local 5/4-competitive algorithm for multicoloring triangle-free hexagonal graphs

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