Improper colouring of weighted grid and hexagonal graphs
Résumé
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.
Origine | Fichiers produits par l'(les) auteur(s) |
---|
Loading...