A 1-local 4/3-competitive algorithm for multicoloring a subclass of hexagonal graphs
Under an Elsevier user license
open archive
Keywords
Hexagonal graphs
Multicoloring
Algorithm
Frequency assignment problem
FAP
Cited by (0)
Copyright © 2011 Elsevier B.V. All rights reserved.