Parameterized complexity of distance labeling and uniform channel assignment problems

Kód výsledku v 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>

Výsledek na webu

<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>

Jazyk výsledku

angličtina

Název v původním jazyce

Parameterized complexity of distance labeling and uniform channel assignment problems

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

Parameterized complexity of distance labeling and uniform channel assignment problems

Popis výsledku anglicky

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.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

<a href="/cs/project/GBP202%2F12%2FG061" target="_blank" >GBP202/12/G061: Centrum excelence - Institut teoretické informatiky (CE-ITI)</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2018

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

Discrete Applied Mathematics

ISSN

0166-218X

e-ISSN

—

Svazek periodika

248

Číslo periodika v rámci svazku

October

Stát vydavatele periodika

NL - Nizozemsko

Počet stran výsledku

10

Strana od-do

46-55

Kód UT WoS článku

000447109400006

EID výsledku v databázi Scopus

2-s2.0-85015869244