Reconfiguring Undirected Paths
Author(s)Demaine, Erik D; Hesterberg, Adam Classen
MetadataShow full item record
We consider problems in which a simple path of fixed length, in an undirected graph, is to be shifted from a start position to a goal position by moves that add an edge to either end of the path and remove an edge from the other end. We show that this problem may be solved in linear time in trees, and is fixed-parameter tractable when parameterized either by the cyclomatic number of the input graph or by the length of the path. However, it is PSPACE -complete for paths of unbounded length in graphs of bounded bandwidth.
DepartmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Science; Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Springer International Publishing
Demaine, Erik D. et al. “Reconfiguring Undirected Paths.” Lecture Notes in Computer Science, 11646 (July 2019): 353-365 © 2019 The Author(s)