1 citations · 1 across the 1 of their papers we have counts for
1 paper
Daniel C. McDonald
We introduce a model involving two adversaries Buster and Fixer taking turns modifying a connected graph, where each round consists of Buster deleting a subset of edges and Fixer r…