On the parameterized complexity of reconfiguration problems
From MaRDI portal
Publication:527426
DOI10.1007/s00453-016-0159-2zbMath1360.68516arXiv1308.2409MaRDI QIDQ527426
Venkatesh Raman, Akira Suzuki, Amer E. Mouawad, Naomi Nishimura, Narges Simjour
Publication date: 11 May 2017
Published in: Algorithmica, Parameterized and Exact Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1308.2409
90C35: Programming involving graphs or networks
68Q25: Analysis of algorithms and problem complexity
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)