License: Creative Commons Attribution-NoDerivs 3.0 Unported license (CC BY-ND 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.STACS.2010.2469
URN: urn:nbn:de:0030-drops-24692
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2010/2469/
Go to the corresponding LIPIcs Volume Portal

Fiala, Jiri ; Kaminski, Marcin ; Lidický, Bernard ; Paulusma, Daniël

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

pdf-format:
1001.FialaJiri.2469.pdf (0.3 MB)

Abstract

Testing whether there is an induced path in a graph spanning $k$ given vertices is already \NP-complete in general graphs when $k=3$. We show how to solve this problem in polynomial time on claw-free graphs, when $k$ is not part of the input but an arbitrarily fixed integer.

BibTeX - Entry

@InProceedings{fiala_et_al:LIPIcs:2010:2469,
  author =	{Jiri Fiala and Marcin Kaminski and Bernard Lidick{\'y} and Dani{\"e}l Paulusma},
  title =	{{The k-in-a-path Problem for Claw-free Graphs}},
  booktitle =	{27th International Symposium on Theoretical Aspects of Computer Science},
  pages =	{371--382},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-16-3},
  ISSN =	{1868-8969},
  year =	{2010},
  volume =	{5},
  editor =	{Jean-Yves Marion and Thomas Schwentick},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2010/2469},
  URN =		{urn:nbn:de:0030-drops-24692},
  doi =		{10.4230/LIPIcs.STACS.2010.2469},
  annote =	{Keywords: Induced path, claw-free graph, polynomial-time algorithm}
}

Keywords: Induced path, claw-free graph, polynomial-time algorithm
Collection: 27th International Symposium on Theoretical Aspects of Computer Science
Issue Date: 2010
Date of publication: 09.03.2010

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI