Pages that link to "Item:Q5361235"
From MaRDI portal
The following pages link to Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas (Q5361235):
Displaying 12 items.
- Dominating sets reconfiguration under token sliding (Q2032965) (← links)
- On reconfigurability of target sets (Q2110378) (← links)
- Optimal reconfiguration of optimal ladder lotteries (Q2227490) (← links)
- Using contracted solution graphs for solving reconfiguration problems (Q2329308) (← links)
- Reconfiguration of maximum-weight \(b\)-matchings in a graph (Q2420651) (← links)
- Shortest Reconfiguration of Perfect Matchings via Alternating Cycles (Q5074950) (← links)
- Homomorphism Reconfiguration via Homotopy (Q5212954) (← links)
- Token sliding on graphs of girth five (Q6182683) (← links)
- Hamiltonian cycle reconfiguration with answer set programming (Q6545539) (← links)
- Recongo: bounded combinatorial reconfiguration with answer set programming (Q6545541) (← links)
- Combinatorial reconfiguration with answer set programming: algorithms, encodings, and empirical analysis (Q6575399) (← links)
- Reconfiguring shortest paths in graphs (Q6623589) (← links)