Abstract

In this paper, we show that Bandwidth is hard for the complexity class W[t] for all t∈ N, even for caterpillars with hair length at most three. As intermediate problem, we introduce the Weighted Path Emulation problem: given a vertex-weighted path PN and integer M, decide if there exists a
... read more