Pages that link to "Item:Q3596704"
From MaRDI portal
The following pages link to On the Complexity of Reconfiguration Problems (Q3596704):
Displaying 15 items.
- The complexity of rerouting shortest paths (Q392173) (← links)
- On the parameterized complexity of reconfiguration problems (Q527426) (← links)
- On the complexity of reconfiguration problems (Q631762) (← links)
- Shortest paths between shortest paths (Q719258) (← links)
- Reconfiguration in bounded bandwidth and tree-depth (Q1686224) (← links)
- Difficult configurations -- on the complexity of LTrL (Q1774566) (← links)
- On reconfigurability of target sets (Q2110378) (← links)
- On the complexity of optimal matching reconfiguration (Q2206232) (← links)
- Inferring local transition functions of discrete dynamical systems from observations of system behavior (Q2357112) (← links)
- On the Complexity of Reconfiguration in Systems with Legacy Components (Q2946354) (← links)
- Shortest Paths between Shortest Paths and Independent Sets (Q3000494) (← links)
- Reconfiguration of List Edge-Colorings in a Graph (Q3183470) (← links)
- Congestion-Free Rerouting of Flows on DAGs (Q5002832) (← links)
- Reconfiguration of graph minors (Q5005179) (← links)
- Reconfiguration of satisfying assignments and subset sums: easy to find, hard to connect (Q5916254) (← links)