Reconfiguring Undirected Paths
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, a...
| Main Authors: | , |
|---|---|
| Other Authors: | , |
| Format: | Article |
| Language: | English |
| Published: |
Springer International Publishing,
2021-01-26T15:32:21Z.
|
| Subjects: | |
| Online Access: | Get fulltext |