Arnab Nayak

Playing with tokens (potentially infinite vertex capacity--Theoretical)

In this paper, a basic token sliding puzzle in graphs (with infinite vertex capacities) has been studied. The rule is in each step (or time epoch) we are moving k tokens simultaneously, where k may be fixed or may be varied over a given set T. The reachability characterisations i...

Playing with tokens (potentially infinite vertex capacity--Theoretical)

In this paper, a basic token sliding puzzle in graphs (with infinite vertex capacities) has been studied. The rule is in each step (or time epoch) we are moving k tokens simultaneously, where k may be fixed or may be varied over a given set T. The reachability characterisations i...