Searching paths of constant bandwidth

Authors:
Bernd Borchert;Klaus Reinhardt
Affiliations:
Universität Tübingen, Tübingen, Germany;Universität Tübingen, Tübingen, Germany
Venue:
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Year:
2006

Citing 3
Cited 1

Color-coding

Journal of the ACM (JACM)
On the structure of parameterized problems in NP

Information and Computation
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

Parameterized algorithmics for linear arrangement problems

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

As a generalization of paths, the notion of paths of bandwidth w is introduced. We show that, for constant w ≥ 1, the corresponding search problem for such a path of length k in a given graph is NP-complete and fixed-parameter tractable (FPT) in the parameter k, like this is known for the special case w = 1, the LONGEST PATH problem. We state the FPT algorithm in terms of a guess and check protocol which uses witnesses of size polynomial in the parameter.