Reconfiguring undirected paths
From MaRDI portal
Recommendations
Cited in
(8)- Reconfiguration of time-respecting arborescences
- Shifting paths to avoidable ones
- Algorithmic meta-theorems for combinatorial reconfiguration revisited
- The parameterized complexity of motion planning for snake-like robots
- Reconfiguring (non-spanning) arborescences
- Reconfiguring directed trees in a digraph
- Fixed-parameter algorithms for graph constraint logic
- Fixed-parameter algorithms for graph constraint logic
This page was built for publication: Reconfiguring undirected paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2285101)