
arXiv: 1405.0847
We show that several reconfiguration problems known to be PSPACE-complete remain so even when limited to graphs of bounded bandwidth. The essential step is noticing the similarity to very limited string rewriting systems, whose ability to directly simulate Turing Machines is classically known. This resolves a question posed open in [Bonsma P., 2012]. On the other hand, we show that a large class of reconfiguration problems becomes tractable on graphs of bounded treedepth, and that this result is in some sense tight.
14 pages
bandwidth, FOS: Computer and information sciences, Discrete Mathematics (cs.DM), Treewidth, Analysis of algorithms and problem complexity, Tree-depth, G.2.2, Computational Complexity (cs.CC), Bandwidth, graph homomorphism, treewidth, reconfiguration, F.2.2; G.2.2; F.4.2, Graph homomorphism, recoloring, Computer Science - Computational Complexity, Graph theory (including graph drawing) in computer science, Reconfiguration, Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), F.4.2, F.2.2, Recoloring, tree-depth, Computer Science - Discrete Mathematics
bandwidth, FOS: Computer and information sciences, Discrete Mathematics (cs.DM), Treewidth, Analysis of algorithms and problem complexity, Tree-depth, G.2.2, Computational Complexity (cs.CC), Bandwidth, graph homomorphism, treewidth, reconfiguration, F.2.2; G.2.2; F.4.2, Graph homomorphism, recoloring, Computer Science - Computational Complexity, Graph theory (including graph drawing) in computer science, Reconfiguration, Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), F.4.2, F.2.2, Recoloring, tree-depth, Computer Science - Discrete Mathematics
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 48 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Top 10% |
