no code implementations • 21 Jun 2018 • Duc A. Hoang, Amanj Khorramian, Ryuhei Uehara
The Sliding Token problem is to determine whether there exists a sequence of independent sets which transforms $I$ into $J$ so that each independent set in the sequence results from the previous one by sliding exactly one token along an edge in the graph.
Data Structures and Algorithms Discrete Mathematics Combinatorics
no code implementations • 15 Mar 2010 • Erik D. Demaine, Martin L. Demaine, Nicholas J. A. Harvey, Ryuhei Uehara, Takeaki Uno, Yushi Uno
This paper investigates the popular card game UNO from the viewpoint of algorithmic combinatorial game theory.
Discrete Mathematics Computational Complexity G.2; F.1
