Sequentially swapping colored tokens on graphs
DOI10.1007/978-3-319-53925-6_34zbMATH Open1451.05154OpenAlexW2587857318MaRDI QIDQ2980931FDOQ2980931
Authors: Katsuhisa Yamanaka, Erik D. Demaine, Takashi Horiyama, Akitoshi Kawamura, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Shin-Ichi Nakano 
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_34
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms (68W40) Coloring of graphs and hypergraphs (05C15) Games on graphs (graph-theoretic aspects) (05C57) Games involving graphs (91A43)
Cites Work
- Graph puzzles, homotopy, and the alternating group
- Title not available (Why is that?)
- Playing games with algorithms: algorithmic combinatorial game theory
- The \((n^ 2-1)\)-puzzle and related relocation problems
- Finding the shortest move-sequence in the graph-generalized 15-puzzle is NP-hard
- Swapping labeled tokens on graphs
- Swapping Colored Tokens on Graphs
Cited In (9)
- Sequentially swapping colored tokens on graphs
- Reconfigurations in Graphs and Grids
- Swapping colored tokens on graphs
- Introduction to reconfiguration
- Approximation and hardness of token swapping
- Swapping labeled tokens on graphs
- Token Swapping on Trees
- Swapping Colored Tokens on Graphs
- Sequentially swapping tokens: further on graph classes
This page was built for publication: Sequentially swapping colored tokens on graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2980931)
