Publication:4636614
From MaRDI portal
DOI10.4230/LIPIcs.STACS.2017.16zbMath1390.68334arXiv1607.07676MaRDI QIDQ4636614
Édouard Bonnet, Paweł Rzążewski, Tillmann Miltzow
Publication date: 19 April 2018
Full work available at URL: https://arxiv.org/abs/1607.07676
NP-hardness; parameterized complexity; W[1-hardness]; token swapping
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
