Partitioning graphs into induced subgraphs

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F20%3A00337278" target="_blank" >RIV/68407700:21240/20:00337278 - isvavai.cz</a>

Výsledek na webu

<a href="https://doi.org/10.1016/j.dam.2019.01.010" target="_blank" >https://doi.org/10.1016/j.dam.2019.01.010</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1016/j.dam.2019.01.010" target="_blank" >10.1016/j.dam.2019.01.010</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Partitioning graphs into induced subgraphs

Popis výsledku v původním jazyce

We study the Partition into H problem from the parameterized complexity point of view. In the Partition into H problem the task is to partition the vertices of a graph G into sets V_1,...,V_r such that the graph H is isomorphic to the subgraph of G induced by each set V_i for i =1,...,r. The pattern graph H is fixed. For the parameterization we consider three distinct structural parameters of the graph G - namely the tree-width, the neighborhood diversity, and the modular-width. For the parameterization by the neighborhood diversity we obtain an FPT algorithm for every graph H. For the parameterization by the tree-width we obtain an FPT algorithm for every connected graph H, thus resolving an open question of Gajarský et al. (2013). Finally, for the parameterization by the modular-width we derive an FPT algorithm for every prime graph H.

Název v anglickém jazyce

Partitioning graphs into induced subgraphs

Popis výsledku anglicky

We study the Partition into H problem from the parameterized complexity point of view. In the Partition into H problem the task is to partition the vertices of a graph G into sets V_1,...,V_r such that the graph H is isomorphic to the subgraph of G induced by each set V_i for i =1,...,r. The pattern graph H is fixed. For the parameterization we consider three distinct structural parameters of the graph G - namely the tree-width, the neighborhood diversity, and the modular-width. For the parameterization by the neighborhood diversity we obtain an FPT algorithm for every graph H. For the parameterization by the tree-width we obtain an FPT algorithm for every connected graph H, thus resolving an open question of Gajarský et al. (2013). Finally, for the parameterization by the modular-width we derive an FPT algorithm for every prime graph H.

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

—

Návaznosti

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2020

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

1872-6771

Svazek periodika

272

Číslo periodika v rámci svazku

January

Stát vydavatele periodika

NL - Nizozemsko

Počet stran výsledku

12

Strana od-do

31-42

Kód UT WoS článku

000509612900005

EID výsledku v databázi Scopus

2-s2.0-85061040499