an:06622020
Zbl 06622020
Fiala, Ji????; Gaven??iak, Tom????; Knop, Du??an; Kouteck??, Martin; Kratochv??l, Jan
Fixed parameter complexity of distance constrained labeling and uniform channel assignment problems. (extended abstract)
EN
Dinh, Thang N. (ed.) et al., Computing and combinatorics. 22nd international conference, COCOON 2016, Ho Chi Minh City, Vietnam, August 2--4, 2016. Proceedings. Cham: Springer (ISBN 978-3-319-42633-4/pbk; 978-3-319-42634-1/ebook). Lecture Notes in Computer Science 9797, 67-78 (2016).
2016
a
68Rxx
Summary: We study computational complexity of the class of distance-constrained graph labeling problems from the fixed parameter tractability point of view. The parameters studied are neighborhood diversity and clique width.
We rephrase the distance constrained graph labeling problem as a specific uniform variant of the \textsc{Channel Assignment} problem and show that this problem is fixed parameter tractable when parameterized by the neighborhood diversity together with the largest weight. Consequently, every \(L(p_1, p_2,\dots, p_k)\)-\textsc{labeling} problem is FPT when parameterized by the neighborhood diversity, the maximum \(p_i\) and \(k\).
Finally, we show that the uniform variant of the \textsc{Channel Assignment} problem becomes NP-complete when generalized to graphs of bounded clique width.
For the entire collection see [Zbl 1342.68014].