Pages that link to "Item:Q631762"
From MaRDI portal
The following pages link to On the complexity of reconfiguration problems (Q631762):
Displayed 9 items.
- The complexity of rerouting shortest paths (Q392173) (← links)
- Complexity of independent set reconfigurability problems (Q441866) (← links)
- Approximability of the subset sum reconfiguration problem (Q489711) (← links)
- Reconfiguration of list edge-colorings in a graph (Q713316) (← links)
- The \(k\)-dominating graph (Q2014712) (← links)
- Reconfiguration of list \(L(2,1)\)-labelings in a graph (Q2250462) (← links)
- Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs (Q2436666) (← links)
- Approximability of the Subset Sum Reconfiguration Problem (Q3010386) (← links)
- An Improved Sufficient Condition for Reconfiguration of List Edge-Colorings in a Tree (Q3010389) (← links)