1-Local 17/12-Competitive Algorithm for Multicoloring Hexagonal Graphs
From MaRDI portal
Publication:3183624
DOI10.1007/978-3-642-03409-1_31zbMath1252.68215OpenAlexW2144881189MaRDI QIDQ3183624
Publication date: 20 October 2009
Published in: Fundamentals of Computation Theory (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-00966383/file/2147-8428-1-PB.pdf
Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Distributed algorithms (68W15)
Related Items
1-local 7/5-competitive Algorithm for Multicoloring Hexagonal Graphs ⋮ 1-local 7/5-competitive algorithm for multicoloring hexagonal graphs ⋮ Simpler multicoloring of triangle-free hexagonal graphs