论文信息 - 2-local Distributed Algorithms for Generalized Coloring of Hexagonal Graphs - 字舞流文

2-local Distributed Algorithms for Generalized Coloring of Hexagonal Graphs

A 2-local distributed approximation algorithm for multicoloring of a triangle-free hexagonal graph which uses at most ⌈(5/4)ω(G)⌉+3 colors is presented.

Janez Zerovnik | Petra Sparl

[1] Janez Zerovnik,et al. 2-local 5/4-competitive Algorithm for Multicoloring Triangle-free Hexagonal Graphs , 2004, Inf. Process. Lett..

[2] Janez Zerovnik,et al. 2-local 4/3-competitive Algorithm for Multicoloring Hexagonal Graphs , 2005, J. Algorithms.

[3] B. Reed,et al. Channel Assignment and Weighted Coloring , 2000 .

[4] Lata Narayanan,et al. Distributed Online Frequency Assignment in Cellular Networks , 2000, J. Algorithms.

[5] Janez Zerovnik,et al. Finding a five bicolouring of a triangle-free subgraph of the triangular lattice , 2002, Discret. Math..

[6] Frédéric Havet,et al. Channel assignment and multicolouring of the induced subgraphs of the triangular lattice , 2001, Discret. Math..