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 (Q4675487)

From MaRDI portal





scientific article; zbMATH DE number 2165449
Language Label Description Also known as
default for all languages
No label defined
    English
    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
    scientific article; zbMATH DE number 2165449

      Statements

      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 (English)
      0 references
      0 references
      0 references
      4 May 2005
      0 references
      Graph coloring
      0 references
      Frequency planning
      0 references
      Cellular networks
      0 references
      2-local distributed algorithm
      0 references

      Identifiers