Improper colouring of weighted grid and hexagonal graphs
Abstract
We study a weighted improper colouring problem on graph, and in particular of triangular and hexagonal grid graphs. This problem is motivated by a frequency allocation problem. We propose approximation algorithms to compute such colouring.
Origin : Files produced by the author(s)
Loading...