The k-in-a-Path Problem for Claw-free Graphs

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F12%3A10125750" target="_blank" >RIV/00216208:11320/12:10125750 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.1007/s00453-010-9468-z" target="_blank" >http://dx.doi.org/10.1007/s00453-010-9468-z</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/s00453-010-9468-z" target="_blank" >10.1007/s00453-010-9468-z</a>

Jazyk výsledku

angličtina

Název v původním jazyce

The k-in-a-Path Problem for Claw-free Graphs

Popis výsledku v původním jazyce

The k-in-a-Path problem is to test whether a graph contains an induced path spanning k given vertices. This problem is NP-complete in general graphs, already when k=3. We show how to solve it in polynomial time on claw-free graphs, when k is an arbitraryfixed integer not part of the input. As a consequence, also the k-Induced Disjoint Paths and the k-in-a-Cycle problem are solvable in polynomial time on claw-free graphs for any fixed k. The first problem has as input a graph G and k pairs of specifiedvertices (s (i) ,t (i) ) for i=1,aEuro broken vertical bar,k and is to test whether G contain k mutually induced paths P (i) such that P (i) connects s (i) and t (i) for i=1,aEuro broken vertical bar,k. The second problem is to test whether a graph contains an induced cycle spanning k given vertices. When k is part of the input, we show that all three problems are NP-complete, even for the class of line graphs, which form a subclass of the class of claw-free graphs.

Název v anglickém jazyce

The k-in-a-Path Problem for Claw-free Graphs

Popis výsledku anglicky

The k-in-a-Path problem is to test whether a graph contains an induced path spanning k given vertices. This problem is NP-complete in general graphs, already when k=3. We show how to solve it in polynomial time on claw-free graphs, when k is an arbitraryfixed integer not part of the input. As a consequence, also the k-Induced Disjoint Paths and the k-in-a-Cycle problem are solvable in polynomial time on claw-free graphs for any fixed k. The first problem has as input a graph G and k pairs of specifiedvertices (s (i) ,t (i) ) for i=1,aEuro broken vertical bar,k and is to test whether G contain k mutually induced paths P (i) such that P (i) connects s (i) and t (i) for i=1,aEuro broken vertical bar,k. The second problem is to test whether a graph contains an induced cycle spanning k given vertices. When k is part of the input, we show that all three problems are NP-complete, even for the class of line graphs, which form a subclass of the class of claw-free graphs.

Druh

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

CEP obor

BA - Obecná matematika

OECD FORD obor

—

Projekt

Výsledek vznikl pri realizaci vícero projektů. Více informací v záložce Projekty.

Návaznosti

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

Rok uplatnění

2012

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

Algorithmica

ISSN

0178-4617

e-ISSN

—

Svazek periodika

62

Číslo periodika v rámci svazku

1-2

Stát vydavatele periodika

DE - Spolková republika Německo

Počet stran výsledku

21

Strana od-do

499-519

Kód UT WoS článku

000298388200022

EID výsledku v databázi Scopus

—