Pages that link to "Item:Q4629977"
From MaRDI portal
The following pages link to The Complexity of Independent Set Reconfiguration on Bipartite Graphs (Q4629977):
Displaying 24 items.
- Complexity of independent set reconfigurability problems (Q441866) (← links)
- On girth and the parameterized complexity of token sliding and Token Jumping (Q1979464) (← links)
- On reconfigurability of target sets (Q2110378) (← links)
- Invitation to combinatorial reconfiguration (Q2154076) (← links)
- Reconfiguration of regular induced subgraphs (Q2154077) (← links)
- Parameterized complexity of reconfiguration of atoms (Q2154105) (← links)
- Parameterized complexity of independent set reconfiguration problems (Q2192091) (← links)
- Can local optimality be used for efficient data reduction? (Q2692734) (← links)
- Reconfiguration of cliques in a graph (Q2700609) (← links)
- Computing \(k\)-independent sets for regular bipartite graphs (Q2717906) (← links)
- Decremental Optimization of Dominating Sets Under the Reconfiguration Framework (Q5041181) (← links)
- Reconfiguration of satisfying assignments and subset sums: easy to find, hard to connect (Q5916254) (← links)
- Feedback vertex set reconfiguration in planar graphs (Q6057837) (← links)
- (Q6087216) (← links)
- On the complexity of distance-\(d\) independent set reconfiguration (Q6091168) (← links)
- Galactic token sliding (Q6098154) (← links)
- Extremal independent set reconfiguration (Q6133144) (← links)
- Reconfiguring Independent Sets on Interval Graphs (Q6168437) (← links)
- Token sliding on graphs of girth five (Q6182683) (← links)
- On the complexity of distance-\(d\) independent set reconfiguration (Q6589843) (← links)
- Minimum separator reconfiguration (Q6615312) (← links)
- Parameterized complexity of reconfiguration of atoms (Q6623588) (← links)
- Algorithmic meta-theorems for combinatorial reconfiguration revisited (Q6623591) (← links)
- On finding short reconfiguration sequences between independent sets (Q6627042) (← links)
