Token sliding on split graphs
From MaRDI portal
Publication:2048202
Recommendations
- Token sliding on split graphs
- Sliding tokens on block graphs
- Token sliding on chordal graphs
- Sliding token on bipartite permutation graphs
- Token shifting on graphs
- Token sliding on graphs of girth five
- Polynomial-time algorithm for sliding tokens on trees
- Token graphs
- Shortest reconfiguration of sliding tokens on subclasses of interval graphs
- Linear-time algorithm for sliding tokens on trees
Cites work
- Complexity of independent set reconfigurability problems
- Dynamic-Programming Algorithms for Recognizing Small-Bandwidth Graphs in Polynomial Time
- Fixed-parameter tractability of token jumping on planar graphs
- Games, puzzles, and computation
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- Introduction to reconfiguration
- Linear-time algorithm for sliding tokens on trees
- On the complexity of reconfiguration problems
- On the Parameterized Complexity for Token Jumping on Graphs
- Parameterized algorithms
- PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation
- Reconfiguration in bounded bandwidth and tree-depth
- Reconfiguration of colorable sets in classes of perfect graphs
- Reconfiguring independent sets in claw-free graphs
- Sliding token on bipartite permutation graphs
- Sliding tokens on a cactus
- The complexity of change
- The complexity of independent set reconfiguration on bipartite graphs
- Token jumping in minor-closed classes
- Token sliding on chordal graphs
Cited in
(32)- On girth and the parameterized complexity of token sliding and token jumping
- Invitation to combinatorial reconfiguration
- Reconfiguration of regular induced subgraphs
- Swapping labeled tokens on graphs
- The complexity of independent set reconfiguration on bipartite graphs
- Linear-time algorithm for sliding tokens on trees
- Token sliding on split graphs
- Token sliding on graphs of girth five
- Parameterized complexity of multicut in weighted trees
- Broadcasting in split graphs
- On the complexity of distance-\(d\) independent set reconfiguration
- On reconfiguration graphs of independent sets under token sliding
- Token sliding on graphs of girth five
- Domination and Cut Problems on Chordal Graphs with Bounded Leafage
- On the complexity of distance-\(d\) independent set reconfiguration
- Algorithmic meta-theorems for combinatorial reconfiguration revisited
- On finding short reconfiguration sequences between independent sets
- Gap preserving reductions between reconfiguration problems
- Independent set reconfiguration under bounded-hop token jumping
- Changing induced subgraph isomorphisms under extended reconfiguration rules
- Domination and cut problems on chordal graphs with bounded leafage
- Algorithmic meta-theorems for combinatorial reconfiguration revisited
- Independent set reconfiguration in H-free graphs
- Changing induced subgraph isomorphisms under extended reconfiguration rules
- Reconfiguration using generalized token jumping
- Independent set reconfiguration under bounded-hop token jumping
- A survey on the parameterized complexity of reconfiguration problems
- Independent set reconfiguration on directed graphs
- The tape reconfiguration problem and its consequences for dominating set reconfiguration
- Coloring reconfiguration under color swapping
- Reachability of independent sets and vertex covers under extended reconfiguration rules
- Token sliding independent set reconfiguration on block graphs
This page was built for publication: Token sliding on split graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2048202)
