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. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Borchert, B., & Reinhardt, K. (2006). Searching paths of constant bandwidth. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3831 LNCS, pp. 187–196). https://doi.org/10.1007/11611257_16
Mendeley helps you to discover research relevant for your work.