Parameterized Complexity of Bandwidth on Trees
From MaRDI portal
Publication:5167759
DOI10.1007/978-3-662-43948-7_34zbMath1412.68080arXiv1404.7810OpenAlexW2117048189MaRDI QIDQ5167759
Daniel Lokshtanov, Markus Sortland Dregi
Publication date: 1 July 2014
Published in: Automata, Languages, and Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1404.7810
Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (3)
From the \(W\)-hierarchy to XNLP. Classes of fixed parameter intractability ⋮ Parameterized complexity of \textsc{bandwidth} of \textsc{caterpillars} and \textsc{weighted path emulation} ⋮ Hardness of computing width parameters based on branch decompositions over the vertex set
This page was built for publication: Parameterized Complexity of Bandwidth on Trees
