1-Local 33/24-Competitive Algorithm for Multicoloring Hexagonal Graphs
From MaRDI portal
Publication:3005572
DOI10.1007/978-3-642-21286-4_7zbMath1328.05185OpenAlexW2156086528MaRDI QIDQ3005572
Janez Žerovnik, Rafał Witkowski
Publication date: 8 June 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-00966383/file/2147-8428-1-PB.pdf
Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Distributed algorithms (68W15)
Related Items (4)
Online Multi-Coloring with Advice ⋮ Online multi-coloring on the path revisited ⋮ Simpler multicoloring of triangle-free hexagonal graphs ⋮ A 1-local 4/3-competitive algorithm for multicoloring a subclass of hexagonal graphs
This page was built for publication: 1-Local 33/24-Competitive Algorithm for Multicoloring Hexagonal Graphs
