Pages that link to "Item:Q2942651"
From MaRDI portal
The following pages link to Vertex Cover Reconfiguration and Beyond (Q2942651):
Displaying 17 items.
- Finding shortest paths between graph colourings (Q309791) (← links)
- Reconfiguration of dominating sets (Q346508) (← links)
- The complexity of dominating set reconfiguration (Q517018) (← links)
- On the parameterized complexity of reconfiguration problems (Q527426) (← links)
- Reconfiguration on nowhere dense graph classes (Q1658772) (← links)
- Editorial: Special issue on reconfiguration problems (Q1712044) (← links)
- On girth and the parameterized complexity of token sliding and Token Jumping (Q1979464) (← links)
- Invitation to combinatorial reconfiguration (Q2154076) (← links)
- Introduction to reconfiguration (Q2331456) (← links)
- Computing the flip distance between triangulations (Q2408209) (← links)
- Reconfiguration of maximum-weight \(b\)-matchings in a graph (Q2420651) (← links)
- Reconfiguration of Steiner Trees in an Unweighted Graph (Q2819500) (← 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)
- (Q6087216) (← links)
