On Structural Parameterizations for the 2-Club Problem

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F15%3A00237626" target="_blank" >RIV/68407700:21240/15:00237626 - isvavai.cz</a>

Výsledek na webu

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

DOI - Digital Object Identifier

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

Jazyk výsledku

angličtina

Název v původním jazyce

On Structural Parameterizations for the 2-Club Problem

Popis výsledku v původním jazyce

The NP-hard textsc{$s$-Club} problem is, given an undirected graph $G=(V,E)$ and~$ell in mathbb{N}$, to decide whether there is a vertex set~$Ssubseteq V$ of size at least~$ell$ such that the induced subgraph~$G[S]$ has diameter at most two. We make progress towards a systematic classification of the complexity of textsc{$s$-Club} with respect to a hierarchy of prominent structural graph parameters. First, we present the following tight NP-hardness results: textsc{$s$-Club} is NP-hard on graphs that become bipartite by deleting one vertex, on graphs that can be covered by three cliques, and on graphs with emph{domination number} two and emph{diameter} three. Then, we consider the parameter emph{$h$-index} of the input graph. The study of this parameteris motivated by real-world instances and the fact that textsc{$s$-Club} is fixed-parameter tractable when parameterized by the larger parameter emph{maximum degree}. We present an algorithm that solves textsc{$s$-Club} in~$|V|^{f(k)}$ ti

Název v anglickém jazyce

On Structural Parameterizations for the 2-Club Problem

Popis výsledku anglicky

The NP-hard textsc{$s$-Club} problem is, given an undirected graph $G=(V,E)$ and~$ell in mathbb{N}$, to decide whether there is a vertex set~$Ssubseteq V$ of size at least~$ell$ such that the induced subgraph~$G[S]$ has diameter at most two. We make progress towards a systematic classification of the complexity of textsc{$s$-Club} with respect to a hierarchy of prominent structural graph parameters. First, we present the following tight NP-hardness results: textsc{$s$-Club} is NP-hard on graphs that become bipartite by deleting one vertex, on graphs that can be covered by three cliques, and on graphs with emph{domination number} two and emph{diameter} three. Then, we consider the parameter emph{$h$-index} of the input graph. The study of this parameteris motivated by real-world instances and the fact that textsc{$s$-Club} is fixed-parameter tractable when parameterized by the larger parameter emph{maximum degree}. We present an algorithm that solves textsc{$s$-Club} in~$|V|^{f(k)}$ ti

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

—

Návaznosti

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2015

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

185

Číslo periodika v rámci svazku

April

Stát vydavatele periodika

NL - Nizozemsko

Počet stran výsledku

14

Strana od-do

79-92

Kód UT WoS článku

000352171600010

EID výsledku v databázi Scopus

2-s2.0-84930479371