Parameterized complexity of distance labeling and uniform channel assignment problems
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F18%3A10385416" target="_blank" >RIV/00216208:11320/18:10385416 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.1016/j.dam.2017.02.010" target="_blank" >https://doi.org/10.1016/j.dam.2017.02.010</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.dam.2017.02.010" target="_blank" >10.1016/j.dam.2017.02.010</a>
Alternative languages
Result language
angličtina
Original language name
Parameterized complexity of distance labeling and uniform channel assignment problems
Original language description
We rephrase the DISTANCE LABELING problem as a specific uniform variant of the CHANNEL ASSIGNMENT problem and show that the latter one is fixed parameter tractable when parameterized by the neighborhood diversity together with the largest weight. Consequently, the DISTANCE LABELING problem is FPT when parameterized by the neighborhood diversity, the maximum p(i) and k. This is indeed a more general answer to an open question of Fiala et al.: Parameterized complexity of coloring problems: Treewidth versus vertex cover. Finally, we show that the uniform variant of the CHANNEL ASSIGNMENT problem becomes NP-complete when generalized to graphs of bounded clique width. (C) 2017 Elsevier B.V. All rights reserved.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
<a href="/en/project/GBP202%2F12%2FG061" target="_blank" >GBP202/12/G061: Center of excellence - Institute for theoretical computer science (CE-ITI)</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2018
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Discrete Applied Mathematics
ISSN
0166-218X
e-ISSN
—
Volume of the periodical
248
Issue of the periodical within the volume
October
Country of publishing house
NL - THE KINGDOM OF THE NETHERLANDS
Number of pages
10
Pages from-to
46-55
UT code for WoS article
000447109400006
EID of the result in the Scopus database
2-s2.0-85015869244