  The average-case complexity of a branch-and-bound algorithms for Minimum
Dominating Set problem in random graphs in the G(n,p) model is studied. We
identify phase transitions between subexponential and exponential average-case
complexities, depending on the growth of the probability p with respect to the
number n of nodes.
