Borchert, Bernd; Reinhardt, Klaus
(2004)
As a generalization of paths, the notion of paths of bandwidth w is introduced. We show that, for a given constant w >= 1, the corresponding search problem for such a path of length k in a given graph is NP-complete and ...