The time complexity of the token swapping problem and its parallel variants
From MaRDI portal
Publication:2980932
DOI10.1007/978-3-319-53925-6_35zbMATH Open1485.68108OpenAlexW2564453173MaRDI QIDQ2980932FDOQ2980932
Authors: Jun Kawahara, Toshiki Saitoh, Ryo Yoshinaka 
Publication date: 5 May 2017
Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-53925-6_35
Recommendations
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Cites Work
- The Time Complexity of the Token Swapping Problem and Its Parallel Variants
- Title not available (Why is that?)
- Paths, Trees, and Flowers
- The complexity of computing the permanent
- How to write a permutation as a product of involutions (and why you might care)
- The minimum-length generator sequence problem is NP-hard
- Title not available (Why is that?)
- The complexity of finding minimum-length generator sequences
- Swapping Colored Tokens on Graphs
- Title not available (Why is that?)
Cited In (8)
- Swapping colored tokens on graphs
- The Time Complexity of the Token Swapping Problem and Its Parallel Variants
- Sequentially Swapping Colored Tokens on Graphs
- Introduction to reconfiguration
- The Time Complexity of Permutation Routing via Matching, Token Swapping and a Variant
- On the Parameterized Complexity for Token Jumping on Graphs
- Discrete coalescent trees
- Token Swapping on Trees
This page was built for publication: The time complexity of the token swapping problem and its parallel variants
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2980932)
