Reconfiguration using generalized token jumping
From MaRDI portal
Cites work
- Complexity of independent set reconfigurability problems
- Distributed reconfiguration of maximal independent sets
- Dominating sets reconfiguration under token sliding
- Envy-freeness in house allocation problems
- Finding paths between 3-colorings
- Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances
- Introduction to reconfiguration
- Linear-time algorithm for sliding tokens on trees
- On girth and the parameterized complexity of token sliding and token jumping
- On representatives of subsets.
- Protecting a graph with mobile guards
- Reconfiguration in bounded bandwidth and tree-depth
- Reconfiguration on sparse graphs
- Reconfiguring independent sets in claw-free graphs
- Relationships between nondeterministic and deterministic tape complexities
- Shortest Dominating Set Reconfiguration under Token Sliding
- Shortest paths between shortest paths
- Shortest reconfiguration of sliding tokens on subclasses of interval graphs
- Shortest reconfiguration paths in the solution space of Boolean formulas
- Shortest reconfiguration sequence for sliding tokens on spiders
- The complexity of bounded length graph recoloring and CSP reconfiguration
- The complexity of dominating set reconfiguration
- The complexity of independent set reconfiguration on bipartite graphs
- The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies
- Token sliding on chordal graphs
- Token sliding on split graphs
- TS-reconfiguration of dominating sets in circle and circular-arc graphs
Cited in
(2)
This page was built for publication: Reconfiguration using generalized token jumping
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6996789)
