4 citations · 7 across the 13 of their papers we have counts for
Showing 2014 · math.COShow all
3 papers · 2 filters
math.CO2014
Rainbow arborescence in random digraphs
Deepak Bal, Patrick Bennett, Colin Cooper +2
We consider the Erdős-Rényi random directed graph process, which is a stochastic process that starts with vertices and no edges, and at each step adds one new directed edge cho…
math.CO2014
Power of choices and rainbow spanning trees in random graphs
Deepak Bal, Patrick Bennett, Alan Frieze +1
We consider the Erdős-Rényi random graph process, which is a stochastic process that starts with vertices and no edges, and at each step adds one new edge chosen uniformly at r…
math.CO2014
The Total Acquisition Number of Random Graphs
Deepak Bal, Patrick Bennett, Andrzej Dudek +1
Let be a graph in which each vertex initially has weight 1. In each step, the weight from a vertex can be moved to a neighbouring vertex , provided that the weight on $v…