37 citations · 92 across the 9 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
math.CO2013
The acquaintance time of (percolated) random geometric graphs
Tobias Muller, Pawel Pralat
In this paper, we study the acquaintance time $\AC(G)$ defined for a connected graph . We focus on $\G(n,r,p)$, a random subgraph of a random geometric graph in which vertic…
math.CO2013
Maker-Breaker games on random geometric graphs
Andrew Beveridge, Andrzej Dudek, Alan Frieze +2
In a Maker-Breaker game on a graph , Breaker and Maker alternately claim edges of . Maker wins if, after all edges have been claimed, the graph induced by his edges has some…