2 citations · 4 across the 2 of their papers we have counts for
3 papers
cs.CC2014
Graph Isomorphism and the Lasserre Hierarchy
Aaron Snook, Grant Schoenebeck, Paolo Codenotti
In this paper we show lower bounds for a certain large class of algorithms solving the Graph Isomorphism problem, even on expander graph instances. Spielman [25] shows an algorithm…
math.CO2013★ 2 cited
On the minimum order of k-cop-win graphs
William Baird, Andrew Beveridge, Anthony Bonato +4
We consider the minimum order graphs with a given cop number. We prove that the minimum order of a connected graph with cop number 3 is 10, and show that the Petersen graph is the…
math.CO2011★ 2 cited
The Petersen graph is the smallest 3-cop-win graph
Andrew Beveridge, Paolo Codenotti, Aaron Maurer +2
In the game of \emph{cops and robbers} on a graph , cops try to catch a robber. On the cop turn, each cop may move to a neighboring vertex or remain in place. On the…