Reconfiguring Undirected Paths
Name
1905.00518.pdf
Description
Submitted version
Size
1.54 MB
Format
Adobe PDF
Checksum (MD5)
93d76494fbc7829f8e1d4e458b507c65
Author(s)
Demaine, Erik D
Hesterberg, Adam Classen
Date Issued
July 2019
Journal
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Publisher
Springer International Publishing
Citation
Demaine, Erik D. et al. “Reconfiguring Undirected Paths.” Lecture Notes in Computer Science, 11646 (July 2019): 353-365 © 2019 The Author(s)
Version
Original manuscript
Abstract
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.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1007/978-3-030-24766-9_26
