Show simple item record

dc.contributor.authorDemaine, Erik D
dc.contributor.authorHesterberg, Adam Classen
dc.date.accessioned2021-01-26T15:32:21Z
dc.date.available2021-01-26T15:32:21Z
dc.date.issued2019-07
dc.identifier.issn0302-9743
dc.identifier.urihttps://hdl.handle.net/1721.1/129566
dc.description.abstractWe 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.en_US
dc.language.isoen
dc.publisherSpringer International Publishingen_US
dc.relation.isversionof10.1007/978-3-030-24766-9_26en_US
dc.rightsCreative Commons Attribution-Noncommercial-Share Alikeen_US
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/4.0/en_US
dc.sourcearXiven_US
dc.titleReconfiguring Undirected Pathsen_US
dc.typeArticleen_US
dc.identifier.citationDemaine, Erik D. et al. “Reconfiguring Undirected Paths.” Lecture Notes in Computer Science, 11646 (July 2019): 353-365 © 2019 The Author(s)en_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Scienceen_US
dc.contributor.departmentMassachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratoryen_US
dc.relation.journalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)en_US
dc.eprint.versionOriginal manuscripten_US
dc.type.urihttp://purl.org/eprint/type/ConferencePaperen_US
eprint.statushttp://purl.org/eprint/status/NonPeerRevieweden_US
dc.date.updated2020-12-09T16:01:50Z
dspace.orderedauthorsDemaine, ED; Eppstein, D; Hesterberg, A; Jain, K; Lubiw, A; Uehara, R; Uno, Yen_US
dspace.date.submission2020-12-09T16:01:54Z
mit.journal.volume11646en_US
mit.licenseOPEN_ACCESS_POLICY
mit.metadata.statusComplete


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record