Back
1-local 7/5-competitive algorithm for multicoloring hexagonal graphs
Authors:
- Rafał Michał Witkowski,
- Janez Žerovnik
Abstract
Hexagonal graphs are graphs induced on subsets of vertices of triangular lattice. They arise naturally in studies of cellular networks. We present a 1-local 7/5-competitive distributed algorithm for multicoloring a hexagonal graph, thereby improving the previous 1-local 17/12-competitive algorithm. © 2010 Elsevier B.V.
- Record ID
- UAM41171b4713b846708fe2f3fc4e6bdb43
- Author
- Journal series
- Electronic Notes in Discrete Mathematics, ISSN 1571-0653
- Issue year
- 2010
- Vol
- 36
- Pages
- 375-382
- ASJC Classification
- ;
- DOI
- DOI:10.1016/j.endm.2010.05.048 Opening in a new tab
- Language
- (en) English
- Score (nominal)
- 0
- Score source
- journalList
- Publication indicators
- = 4; : 2010 = 0.343
Share
- Uniform Resource Identifier
- https://researchportal.amu.edu.pl/info/article/UAM41171b4713b846708fe2f3fc4e6bdb43/
- URN
urn:amu-prod:UAM41171b4713b846708fe2f3fc4e6bdb43
* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or PerishOpening in a new tab system.