On Parameterized Path and Chordless Path Problems

descriptionPublicationkeyboard_double_arrow_right Article , Conference object 01 Jun 2007Publisher:IEEEJournal:Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07) (issn: 1093-0159,

Copyright policy )

Authors: Yijia Chen 0001; Jörg Flum;

doi: 10.1109/ccc.2007.21

On Parameterized Path and Chordless Path Problems

- Summary
- Metrics

Abstract

We study the parameterized complexity of various path (and cycle) problems, the parameter being the length of the path. For example, we show that the problem of the existence of a maximal path of length k in a graph G is fixed-parameter tractable, while its counting version is #W[1]- complete. The corresponding problems for chordless (or induced) paths are W[2]-complete and #W[2]-complete respectively. With the tools developed in this paper we derive the NP-completeness of a related classical problem, thereby solving a problem due to Hedetniemi.

Related Organizations

Shanghai Jiao Tong University
China (People's Republic of)
University of Freiburg
Germany

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	13
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average