Sequentially Swapping Colored Tokens on Graphs

DOI10.1007/978-3-319-53925-6_34zbMath1451.05154OpenAlexW2587857318MaRDI QIDQ2980931

Akitoshi Kawamura, Ryuhei Uehara, Takashi Horiyama, Yoshio Okamoto, Toshiki Saitoh, Katsuhisa Yamanaka, Erik D. Demaine, Akira Suzuki, 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

Analysis of algorithms (68W40) Games involving graphs (91A43) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Games on graphs (graph-theoretic aspects) (05C57)

Related Items

Token Swapping on Trees ⋮ Introduction to reconfiguration

Cites Work

• The \((n^ 2-1)\)-puzzle and related relocation problems
• Graph puzzles, homotopy, and the alternating group
• Swapping labeled tokens on graphs
• Finding the Shortest Move-Sequence in the Graph-Generalized 15-Puzzle Is NP-Hard
• Swapping Colored Tokens on Graphs
• Playing Games with Algorithms: Algorithmic Combinatorial Game Theory
• Unnamed Item

This page was built for publication: Sequentially Swapping Colored Tokens on Graphs