Pages that link to "Item:Q441866"
From MaRDI portal
The following pages link to Complexity of independent set reconfigurability problems (Q441866):
Displaying 22 items.
- Reconfiguring spanning and induced subgraphs (Q5916255) (← links)
- Incremental optimization of independent sets under the reconfiguration framework (Q5918743) (← links)
- Independent set reconfiguration parameterized by modular-width (Q5918925) (← links)
- Fixed-parameter algorithms for graph constraint logic (Q6041672) (← links)
- Feedback vertex set reconfiguration in planar graphs (Q6057837) (← links)
- (Q6087216) (← links)
- (Q6089660) (← links)
- On the complexity of distance-\(d\) independent set reconfiguration (Q6091168) (← links)
- Galactic token sliding (Q6098154) (← links)
- On reconfiguration graphs of independent sets under token sliding (Q6115427) (← links)
- Extremal independent set reconfiguration (Q6133144) (← links)
- Computational complexity of jumping block puzzles (Q6144017) (← links)
- Induced paths in graphs without anticomplete cycles (Q6144401) (← links)
- Transportation Problem Allowing Sending and Bringing Back (Q6175213) (← links)
- Token sliding on graphs of girth five (Q6182683) (← links)
- Computational complexity of puzzles and related topics (Q6535387) (← 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)
- On the complexity of distance-\(d\) independent set reconfiguration (Q6589843) (← links)
- Algorithmic meta-theorems for combinatorial reconfiguration revisited (Q6623591) (← links)
- On finding short reconfiguration sequences between independent sets (Q6627042) (← links)
