Pages that link to "Item:Q496016"
From MaRDI portal
The following pages link to Linear-time algorithm for sliding tokens on trees (Q496016):
Displaying 28 items.
- The complexity of dominating set reconfiguration (Q517018) (← links)
- Complexity of token swapping and its variants (Q722547) (← links)
- Independent-set reconfiguration thresholds of hereditary graph classes (Q1801058) (← links)
- Token sliding on split graphs (Q2048202) (← links)
- On reconfigurability of target sets (Q2110378) (← links)
- Distributed reconfiguration of maximal independent sets (Q2186816) (← links)
- Parameterized complexity of independent set reconfiguration problems (Q2192091) (← 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)
- Shortest Reconfiguration of Sliding Tokens on a Caterpillar (Q2803826) (← links)
- Reconfiguration of Steiner Trees in an Unweighted Graph (Q2819500) (← links)
- The Complexity of (List) Edge-Coloring Reconfiguration Problem (Q2980922) (← links)
- Sliding Tokens on Block Graphs (Q2980933) (← 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)
- Complexity of Coloring Reconfiguration under Recolorability Constraints (Q5136283) (← links)
- Reconfiguration of satisfying assignments and subset sums: easy to find, hard to connect (Q5916254) (← links)
- Independent set reconfiguration parameterized by modular-width (Q5918925) (← links)
- Reconfiguration of Hamiltonian Cycles in Rectangular Grid Graphs (Q6066461) (← links)
- Reconfiguration of connected graph partitions (Q6093138) (← links)
- Galactic token sliding (Q6098154) (← links)
- On reconfiguration graphs of independent sets under token sliding (Q6115427) (← links)
- Computational complexity of puzzles and related topics (Q6535387) (← links)
- On the complexity of distance-\(d\) independent set reconfiguration (Q6589843) (← links)
