22 citations · 92 across the 73 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2024
Token Jumping in Planar Graphs has Linear Sized Kernels
Daniel W. Cranston
Let be a planar graph and and be two independent sets in , each of size . We begin with a "token" on each vertex of and seek to move all tokens to …
cs.DM2012★ 1 cited
Revolutionaries and spies: Spy-good and spy-bad graphs
Jane V. Butterfield, Daniel W. Cranston, Gregory J. Puleo +2
We study a game on a graph played by {\it revolutionaries} and {\it spies}. Initially, revolutionaries and then spies occupy vertices. In each subsequent round, each re…