Corpus ID: 81978110

Token Swapping on Trees

  title={Token Swapping on Trees},
  author={A. Biniaz and Kshitij Jain and A. Lubiw and Z. Mas{\'a}rov{\'a} and Tillmann Miltzow and D. Mondal and Anurag Murty Naredla and Josef Tkadlec and Alexi Turcotte},
  • A. Biniaz, Kshitij Jain, +6 authors Alexi Turcotte
  • Published 2019
  • Mathematics, Computer Science
  • ArXiv
  • The input to the token swapping problem is a graph with vertices $v_1, v_2, \ldots, v_n$, and $n$ tokens with labels $1, 2, \ldots, n$, one on each vertex. The goal is to get token $i$ to vertex $v_i$ for all $i= 1, \ldots, n$ using a minimum number of \emph{swaps}, where a swap exchanges the tokens on the endpoints of an edge. Token swapping on a tree, also known as "sorting with a transposition tree", is not known to be in P nor NP-complete. We present some partial results: 1. An optimum… CONTINUE READING
    2 Citations
    Friends and Strangers Walking on Graphs
    • 1
    • PDF
    An Upper Bound for Sorting Rn with LRE
    • 1
    • PDF


    Complexity of Token Swapping and its Variants
    • 26
    • PDF
    Approximation and Hardness of Token Swapping
    • 15
    Swapping Labeled Tokens on Graphs
    • 35
    • PDF
    How to Sort by Walking and Swapping on Paths and Trees
    • Daniel Graf
    • Mathematics, Computer Science
    • Algorithmica
    • 2017
    • 1
    • PDF
    Swapping Colored Tokens on Graphs
    • 12
    • Highly Influential
    • PDF
    The Time Complexity of Permutation Routing via Matching, Token Swapping and a Variant
    • 2
    • PDF
    Sorting on graphs by adjacent swaps using permutation groups
    • D. Kim
    • Computer Science
    • Comput. Sci. Rev.
    • 2016
    • 7
    The Time Complexity of the Token Swapping Problem and Its Parallel Variants
    • 17
    • PDF
    Diameter of Cayley graphs generated by transposition trees
    • 13
    • PDF
    Reconfigurations in Graphs and Grids
    • 30
    • PDF