On the Parameterized Complexity for Token Jumping on Graphs
From MaRDI portal
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25)
Recommendations
- Fixed-parameter tractability of token jumping on planar graphs
- On girth and the parameterized complexity of token sliding and token jumping
- scientific article; zbMATH DE number 7765402
- Complexity of circulant graphs with non-fixed jumps, its arithmetic properties and asymptotics
- scientific article; zbMATH DE number 3896963
- scientific article; zbMATH DE number 3917707
- On the parameterized complexity of multiple-interval graph problems
- On the parameterized complexity of edge-linked paths
- Polynomial-time algorithm for sliding tokens on trees
- The time complexity of the token swapping problem and its parallel variants
Cited in
(26)- Reconfiguration on nowhere dense graph classes
- On girth and the parameterized complexity of token sliding and token jumping
- Token sliding on split graphs
- Parameterized complexity of independent set reconfiguration problems
- Introduction to reconfiguration
- Fixed-parameter tractability of token jumping on planar graphs
- Linear-time algorithm for sliding tokens on trees
- Token sliding on split graphs
- The Perfect Matching Reconfiguration Problem
- Shortest reconfiguration paths in the solution space of Boolean formulas
- Incremental optimization of independent sets under the reconfiguration framework
- Token sliding on graphs of girth five
- scientific article; zbMATH DE number 7765402 (Why is no real title available?)
- Galactic token sliding
- Token sliding on graphs of girth five
- Hamiltonian cycle reconfiguration with answer set programming
- Recongo: bounded combinatorial reconfiguration with answer set programming
- On finding short reconfiguration sequences between independent sets
- On finding short reconfiguration sequences between independent sets
- Reconfiguring multiple connected components with size multiset constraints
- Galactic token sliding
- Independent set reconfiguration in H-free graphs
- Some results on vertex separator reconfiguration
- A survey on the parameterized complexity of reconfiguration problems
- Independent set reconfiguration on directed graphs
- Parameterized complexities of dominating and independent set reconfiguration
This page was built for publication: On the Parameterized Complexity for Token Jumping on Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5410654)
