| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10151227 | Discrete Applied Mathematics | 2018 | 10 Pages |
Abstract
Finally, we show that the uniform variant of the Channel Assignment problem becomes NP-complete when generalized to graphs of bounded clique width.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
JiÅà Fiala, TomáÅ¡ GavenÄiak, DuÅ¡an Knop, Martin Koutecký, Jan KratochvÃl,