A 1-Local 13/9-Competitive Algorithm for Multicoloring Hexagonal Graphs

DOI10.1007/978-3-540-73545-8_51zbMath1176.68236OpenAlexW1540103176MaRDI QIDQ3608876

Hong Zhu, Yong Zhang, Francis Y. L. Chin

Publication date: 6 March 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73545-8_51

zbMATH Keywords

online algorithmmulticoloringhexagonal graphs

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15) Online algorithms; streaming algorithms (68W27)

Related Items (5)

On modeling and analysis of MIMO wireless mesh networks with triangular overlay topology ⋮ Better bounds for incremental frequency allocation in bipartite graphs ⋮ Simpler multicoloring of triangle-free hexagonal graphs ⋮ Absolute and asymptotic bounds for online frequency allocation in cellular networks ⋮ Three results on frequency assignment in linear cellular networks

This page was built for publication: A 1-Local 13/9-Competitive Algorithm for Multicoloring Hexagonal Graphs