Name
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. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1007/978-3-030-24766-9_26 | WADS |
DocType | Volume | Citations |
Conference | abs/1905.00518 | 0 |
PageRank | References | Authors |
0.34 | 0 | 7 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Erik D. Demaine | 1 | 4624 | 388.59 |
| David Eppstein | 2 | 4897 | 533.94 |
| Adam Hesterberg | 3 | 4 | 7.07 |
| Kshitij Jain | 4 | 0 | 1.35 |
| Anna Lubiw | 5 | 753 | 95.36 |
| Ryuhei Uehara | 6 | 528 | 75.38 |
| yushi uno | 7 | 222 | 28.80 |