Pages that link to "Item:Q441866"
From MaRDI portal
The following pages link to Complexity of independent set reconfigurability problems (Q441866):
Displayed 14 items.
- Finding shortest paths between graph colourings (Q309791) (← links)
- The complexity of rerouting shortest paths (Q392173) (← links)
- Approximability of the subset sum reconfiguration problem (Q489711) (← links)
- Linear-time algorithm for sliding tokens on trees (Q496016) (← links)
- Reconfiguration on sparse graphs (Q1747496) (← links)
- Reconfiguration of list \(L(2,1)\)-labelings in a graph (Q2250462) (← links)
- Shortest Reconfiguration of Sliding Tokens on a Caterpillar (Q2803826) (← links)
- Reconfiguration of Steiner Trees in an Unweighted Graph (Q2819500) (← links)
- Independent Set Reconfiguration in Cographs and their Generalizations (Q2825488) (← links)
- Vertex Cover Reconfiguration and Beyond (Q2942651) (← links)
- Finding Shortest Paths Between Graph Colourings (Q2946021) (← links)
- Reconfiguration of Vertex Covers in a Graph (Q2946052) (← links)
- Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas (Q3448854) (← links)
- The Complexity of Dominating Set Reconfiguration (Q3449837) (← links)