2-local distributed algorithms for generalized coloring of hexagonal graphs

DOI10.1016/J.ENDM.2005.06.042MaRDI QIDQ3439359zbMATH OpenOpenAlexFDO

Authors Janez Žerovnik, Petra Šparl

Publication date 29 May 2007

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2005.06.042

zbMATH Keywords

approximation algorithmfrequency planninggraph coloringk-local distributed algorithm

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Cites work

• 2-local 5/4-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
• Channel assignment and multicolouring of the induced subgraphs of the triangular lattice
• Channel assignment and weighted coloring
• Distributed Online Frequency Assignment in Cellular Networks
• Finding a five bicolouring of a triangle-free subgraph of the triangular lattice

This page was built for publication: 2-local distributed algorithms for generalized coloring of hexagonal graphs

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