2 citations · 2 across the 10 of their papers we have counts for
Showing cs.DMShow all
3 papers · 1 filter
cs.DM2023
Random processes for generating task-dependency graphs
Jesse Geneson, Shen-Fu Tsai
We investigate random processes for generating task-dependency graphs of order with edges and a specified number of initial vertices and terminal vertices. In order to do s…
cs.DM2019★ 2 cited
Expected capture time and throttling number for cop versus gambler
Jesse Geneson, Carl Joshua Quines, Espen Slettnes +1
We bound expected capture time and throttling number for the cop versus gambler game on a connected graph with vertices, a variant of the cop versus robber game that is played…
cs.DM2017
Variations of the cop and robber game on graphs
Espen Slettnes, Carl Joshua Quines, Shen-Fu Tsai +1
We prove new theoretical results about several variations of the cop and robber game on graphs. First, we consider a variation of the cop and robber game which is more symmetric ca…