Sequentially swapping colored tokens on graphs

DOI10.1007/978-3-319-53925-6_34MaRDI QIDQ2980931zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

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)

Recommendations

• Sequentially swapping colored tokens on graphs
• Swapping labeled tokens on graphs
• Swapping colored tokens on graphs
• Swapping Colored Tokens on Graphs
• Approximation and hardness of token swapping

Cites work

• scientific article; zbMATH DE number 2115805 (Why is no real title available?)
• Finding the shortest move-sequence in the graph-generalized 15-puzzle is NP-hard
• Graph puzzles, homotopy, and the alternating group
• Playing games with algorithms: algorithmic combinatorial game theory
• Swapping Colored Tokens on Graphs
• Swapping labeled tokens on graphs
• The \((n^ 2-1)\)-puzzle and related relocation problems

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
• Swapping Colored Tokens on Graphs
• Token Swapping on Trees
• 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)