On the Complexity of Reconfiguration Problems
From MaRDI portal
Cited in
(21)- The complexity of rerouting shortest paths
- Reconfiguration of List Edge-Colorings in a Graph
- On the polynomiality of finding \(^K\text{DMDGP}\) re-orders
- On reconfigurability of target sets
- Congestion-free rerouting of flows on DAGs
- Minimum maximum reconfiguration cost problem
- On the complexity of optimal matching reconfiguration
- Inferring local transition functions of discrete dynamical systems from observations of system behavior
- Difficult configurations -- on the complexity of LTrL
- Reconfiguration in bounded bandwidth and tree-depth
- On the Complexity of Reconfiguration in Systems with Legacy Components
- Introduction to reconfiguration
- On the complexity of reconfiguration problems
- Shortest paths between shortest paths
- Shortest Paths between Shortest Paths and Independent Sets
- The complexity of change
- Reconfiguration of graph minors
- On limitations of transformations between combinatorial problems
- Editorial: Special issue on reconfiguration problems
- Hamiltonian cycle reconfiguration with answer set programming
- Degree-constrained subgraph reconfiguration is in P
This page was built for publication: On the Complexity of Reconfiguration Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3596704)