Hardness of token swapping on trees
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 30751 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1339500 (Why is no real title available?)
- scientific article; zbMATH DE number 1052006 (Why is no real title available?)
- scientific article; zbMATH DE number 798638 (Why is no real title available?)
- scientific article; zbMATH DE number 7696310 (Why is no real title available?)
- A group-theoretic model for symmetric interconnection networks
- Approximation and hardness of token swapping
- Complexity of token swapping and its variants
- Coordinated motion planning: reconfiguring a swarm of labeled robots with bounded stretch
- Desiderata and suggestions. No. 1: The theory of groups. No. 2: Graphical representation.
- Diameters of Cayley graphs generated by transposition trees
- New results on routing via matchings on graphs
- On the hardness of optimal vertex relabeling and restricted vertex relabeling
- Optimal Bounds for Matching Routing on Trees
- Reduced decompositions of permutations in terms of star transpositions, generalized Catalan numbers and k-ary trees
- Routing Permutations on Graphs via Matchings
- Routing numbers of cycles, complete bipartite graphs, and hypercubes
- Sorting on graphs by adjacent swaps using permutation groups
- Sorting permutations with transpositions in \(O(n^3)\) amortized time
- Swapping colored tokens on graphs
- Swapping labeled tokens on graphs
- The Complexity of Coloring Circular Arcs and Chords
- The complexity of finding minimum-length generator sequences
- The time complexity of permutation routing via matching, token swapping and a variant
- Whitney numbers of the second kind for the star poset
Cited in
(4)
This page was built for publication: Hardness of token swapping on trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6969688)
