38 citations · 108 across the 33 of their papers we have counts for
3 papers · 1 filter
Capture times in the Bridge-burning Cops and Robbers game
Rebekah Herrman, Peter van Hintum, Stephen G. Z. Smith
In this paper, we consider a variant of the cops and robbers game on a graph, introduced by Kinnersley and Peterson, in which every time the robber uses an edge, it is removed from…
Lower Bounds on Circuit Depth of the Quantum Approximate Optimization Algorithm
James Ostrowski, Rebekah Herrman, Travis S. Humble +1
The quantum approximate optimization algorithm (QAOA) is a method of approximately solving combinatorial optimization problems. While QAOA is developed to solve a broad class of co…
The Eternal Game Chromatic Number of Random Graphs
Vojtěch Dvořák, Rebekah Herrman, Peter van Hintum
The eternal graph colouring problem, recently introduced by Klostermeyer and Mendoza, is a version of the graph colouring game, where two players take turns properly colouring a gr…