Pages that link to "Item:Q441866"
From MaRDI portal
The following pages link to Complexity of independent set reconfigurability problems (Q441866):
Displaying 50 items.
- Finding shortest paths between graph colourings (Q309791) (← links)
- Reconfiguration of dominating sets (Q346508) (← 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)
- The complexity of dominating set reconfiguration (Q517018) (← links)
- Reconfiguration on nowhere dense graph classes (Q1658772) (← links)
- Reconfiguration in bounded bandwidth and tree-depth (Q1686224) (← links)
- Reconfiguration on sparse graphs (Q1747496) (← links)
- Independent-set reconfiguration thresholds of hereditary graph classes (Q1801058) (← links)
- On girth and the parameterized complexity of token sliding and Token Jumping (Q1979464) (← links)
- Dominating sets reconfiguration under token sliding (Q2032965) (← links)
- Token sliding on split graphs (Q2048202) (← links)
- On reconfigurability of target sets (Q2110378) (← links)
- Invitation to combinatorial reconfiguration (Q2154076) (← links)
- Reconfiguration of regular induced subgraphs (Q2154077) (← links)
- Distributed reconfiguration of maximal independent sets (Q2186816) (← links)
- Parameterized complexity of independent set reconfiguration problems (Q2192091) (← links)
- Reconfiguration of list \(L(2,1)\)-labelings in a graph (Q2250462) (← links)
- Using contracted solution graphs for solving reconfiguration problems (Q2329308) (← links)
- Introduction to reconfiguration (Q2331456) (← links)
- Reconfiguration of maximum-weight \(b\)-matchings in a graph (Q2420651) (← links)
- Reconfiguration of colorable sets in classes of perfect graphs (Q2632018) (← links)
- Shortest reconfiguration of sliding tokens on subclasses of interval graphs (Q2658043) (← links)
- Computational complexity of jumping block puzzles (Q2695336) (← links)
- Reconfiguration of cliques in a graph (Q2700609) (← 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)
- A Reconfigurations Analogue of Brooks' Theorem and Its Consequences (Q2833252) (← 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)
- Sliding Tokens on Block Graphs (Q2980933) (← links)
- Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas (Q3448854) (← links)
- The Complexity of Dominating Set Reconfiguration (Q3449837) (← links)
- (Q5005179) (← links)
- (Q5026983) (← links)
- Decremental Optimization of Dominating Sets Under the Reconfiguration Framework (Q5041181) (← links)
- Shortest Reconfiguration of Perfect Matchings via Alternating Cycles (Q5074950) (← links)
- (Q5075806) (← links)
- (Q5090459) (← links)
- Distributed Reconfiguration of Maximal Independent Sets (Q5092338) (← links)
- The Perfect Matching Reconfiguration Problem (Q5092444) (← links)
- Reconfiguration of Colorable Sets in Classes of Perfect Graphs (Q5116491) (← links)
- Homomorphism Reconfiguration via Homotopy (Q5212954) (← links)
- Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas (Q5361235) (← links)
- Reconfiguration of satisfying assignments and subset sums: easy to find, hard to connect (Q5916254) (← links)
- Reconfiguring spanning and induced subgraphs (Q5916255) (← links)
- Incremental optimization of independent sets under the reconfiguration framework (Q5918743) (← links)