Partitioning Graphs into Induced Subgraphs
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F17%3A10366359" target="_blank" >RIV/00216208:11320/17:10366359 - isvavai.cz</a>
Result on the web
<a href="https://arxiv.org/abs/1508.04725" target="_blank" >https://arxiv.org/abs/1508.04725</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-319-53733-7_25" target="_blank" >10.1007/978-3-319-53733-7_25</a>
Alternative languages
Result language
angličtina
Original language name
Partitioning Graphs into Induced Subgraphs
Original language description
We study the Partition into H problem from the parametrized complexity point of view. In the Partition into H problem the task is to partition the vertices of a graph G into sets V1,...,Vr such that the graph H is isomorphic to the subgraph of G induced by each set Vi for i=1,...,r. The pattern graph H is fixed. For the parametrization we consider three distinct structural parameters of the graph G - namely the tree-width, the neighborhood diversity, and the modular-width. For the parametrization by the neighborhood diversity we obtain an FPT algorithm for every graph H. For the parametrization by the tree-width we obtain an FPT algorithm for every connected graph H. Thus resolving an open question of Gajarský et al. from IPEC 2013. Finally, for the parametrization by the modular-width we derive an FPT algorithm for every prime graph H.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
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
2017
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
Article name in the collection
Language and Automata Theory and Applications
ISBN
978-3-319-53732-0
ISSN
—
e-ISSN
neuvedeno
Number of pages
13
Pages from-to
338-350
Publisher name
Springer International Publishing AG 2017
Place of publication
Neuveden
Event location
Umea
Event date
Mar 6, 2017
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—