Reconfiguring directed trees in a digraph
From MaRDI portal
Publication:2695298
DOI10.1007/978-3-030-89543-3_29OpenAlexW3208188128MaRDI QIDQ2695298
Yota Otachi, Takehiro Ito, Yasuaki Kobayashi, Kunihiro Wasa, Yu Nakahata, Yuni Iwamasa
Publication date: 30 March 2023
Full work available at URL: https://doi.org/10.1007/978-3-030-89543-3_29
Related Items
Reconfiguring (non-spanning) arborescences ⋮ Brief announcement: Distributed reconfiguration of spanning trees
Cites Work
- Unnamed Item
- On the complexity of reconfiguration problems
- The complexity of Snake and undirected NCL variants
- Reconfiguring undirected paths
- Degree-Constrained Subgraph Reconfiguration is in P
- The Parameterized Complexity of Motion Planning for Snake-Like Robots
- Reconfiguring spanning and induced subgraphs