Approximation and hardness of token swapping
From MaRDI portal
Recommendations
Cited in
(28)- Swapping colored tokens on graphs
- Multivariate complexity analysis of Swap Bribery
- Shortest reconfiguration of matchings
- Introduction to reconfiguration
- How to sort by walking and swapping on paths and trees
- Sequentially swapping colored tokens on graphs
- The time complexity of the token swapping problem and its parallel variants
- Sequentially swapping colored tokens on graphs
- The time complexity of permutation routing via matching, token swapping and a variant
- Complexity of token swapping and its variants
- Shortest reconfiguration of perfect matchings via alternating cycles
- Connecting the dots (with minimum crossings)
- scientific article; zbMATH DE number 7559364 (Why is no real title available?)
- Token Swapping on Trees
- Reconfiguration of connected graph partitions
- Improving quantum computation by optimized qubit routing
- Algorithmic theory of qubit routing
- On the diameters of friends-and-strangers graphs
- Gap preserving reductions between reconfiguration problems
- Sequentially swapping tokens: further on graph classes
- Parallel token swapping for qubit routing
- Qubit mapping: the adaptive divide-and-conquer approach
- Hardness of token swapping on trees
- Friends-and-strangers is \textsf{PSPACE}-complete
- Complexity of token swapping and its variants
- Coordinated motion planning: multi-agent path finding in a densely packed, bounded domain
- Reconfiguration of labeled matchings in triangular grid graphs
- Reconfiguration of labeled matchings in triangular grid graphs
This page was built for publication: Approximation and hardness of token swapping
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4606338)
