Parameterized complexity of \textsc{bandwidth} of \textsc{caterpillars} and \textsc{weighted path emulation}

DOI10.1007/978-3-030-86838-3_2MaRDI QIDQ2672420

Hans L. Bodlaender

Publication date: 8 June 2022

Full work available at URL: https://arxiv.org/abs/2012.01226

zbMATH Keywords

bandwidth; parameterized complexity; caterpillars; W-hierarchy; weighted path emulation

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science