On Structural Parameterizations of the Bounded-Degree Vertex
Deletion Problem

D 2018

On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem

GANIAN, Robert, Fabian KLUTE a Sebastian ORDYNIAK

Základní údaje

Originální název

On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem

Autoři

GANIAN, Robert (203 Česká republika, garant, domácí), Fabian KLUTE (276 Německo) a Sebastian ORDYNIAK (276 Německo)

Vydání

Nemecko, STACS 2018, od s. 1-14, 14 s. 2018

Nakladatel

Dagstuhl

Další údaje

Jazyk

angličtina

Typ výsledku

Stať ve sborníku

Obor

10201 Computer sciences, information science, bioinformatics

Stát vydavatele

Německo

Utajení

není předmětem státního či obchodního tajemství

Forma vydání

elektronická verze "online"

Kód RIV

RIV/00216224:14330/18:00106812

Organizační jednotka

Fakulta informatiky

ISBN

978-3-95977-062-0

ISSN

DOI

http://dx.doi.org/10.4230/LIPIcs.STACS.2018.33

UT WoS

000521090200033

Klíčová slova anglicky

bounded-degree vertex deletion; feedback vertex set; parameterized algorithms; treecut width

Štítky

core_A, firank_A

Příznaky

Mezinárodní význam, Recenzováno

Změněno: 24. 4. 2020 15:55, Mgr. Michal Petr

Anotace

V originále

We study the parameterized complexity of the Bounded-Degree Vertex Deletion problem (BDD), where the aim is to find a maximum induced subgraph whose maximum degree is below a given degree bound. Our focus lies on parameters that measure the structural properties of the input instance. We first show that the problem is W[1]-hard parameterized by a wide range of fairly restrictive structural parameters such as the feedback vertex set number, pathwidth, treedepth, and even the size of a minimum vertex deletion set into graphs of pathwidth and treedepth at most three. We thereby resolve the main open question stated in Betzler, Bredereck, Niedermeier and Uhlmann (2012) concerning the complexity of BDD parameterized by the feedback vertex set number. On the positive side, we obtain fixed-parameter algorithms for the problem with respect to the decompositional parameter treecut width and a novel problem-specific parameter called the core fracture number.

Návaznosti

MSM0021622419, záměr

Název: Vysoce paralelní a distribuované výpočetní systémy

Investor: Ministerstvo školství, mládeže a tělovýchovy ČR, Vysoce paralelní a distribuované výpočetní systémy

Citovat

GANIAN, Robert, Fabian KLUTE a Sebastian ORDYNIAK. On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem. Online. In Rolf Niedermeier, Brigitte Vallee. STACS 2018. Nemecko: Dagstuhl, 2018, s. 1-14. ISBN 978-3-95977-062-0. Dostupné z: https://dx.doi.org/10.4230/LIPIcs.STACS.2018.33.

@inproceedings{1523738,
   author = {Ganian, Robert and Klute, Fabian and Ordyniak, Sebastian},
   address = {Nemecko},
   booktitle = {STACS 2018},
   doi = {http://dx.doi.org/10.4230/LIPIcs.STACS.2018.33},
   editor = {Rolf Niedermeier, Brigitte Vallee},
   keywords = {bounded-degree vertex deletion; feedback vertex set; parameterized algorithms; treecut width},
   howpublished = {elektronická verze "online"},
   language = {eng},
   location = {Nemecko},
   isbn = {978-3-95977-062-0},
   pages = {1-14},
   publisher = {Dagstuhl},
   title = {On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem},
   year = {2018}
}

TY  - JOUR
ID  - 1523738
AU  - Ganian, Robert - Klute, Fabian - Ordyniak, Sebastian
PY  - 2018
TI  - On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem
PB  - Dagstuhl
CY  - Nemecko
SN  - 9783959770620
KW  - bounded-degree vertex deletion
KW  - feedback vertex set
KW  - parameterized algorithms
KW  - treecut width
N2  - We study the parameterized complexity of the Bounded-Degree Vertex Deletion problem (BDD), where the aim is to find a maximum induced subgraph whose maximum degree is below a given degree bound. Our focus lies on parameters that measure the structural properties of the input instance. We first show that the problem is W[1]-hard parameterized by a wide range of fairly restrictive structural parameters such as the feedback vertex set number, pathwidth, treedepth, and even the size of a minimum vertex deletion set into graphs of pathwidth and treedepth at most three. We thereby resolve the main open question stated in Betzler, Bredereck, Niedermeier and Uhlmann (2012) concerning the complexity of BDD parameterized by the feedback vertex set number. On the positive side, we obtain fixed-parameter algorithms for the problem with respect to the decompositional parameter treecut width and a novel problem-specific parameter called the core fracture number.
ER  -

GANIAN, Robert, Fabian KLUTE a Sebastian ORDYNIAK. On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem. Online. In Rolf Niedermeier, Brigitte Vallee. \textit{STACS 2018}. Nemecko: Dagstuhl, 2018, s.~1-14. ISBN~978-3-95977-062-0. Dostupné z: https://dx.doi.org/10.4230/LIPIcs.STACS.2018.33.

Podrobný výpis o publikaci