On the Performance of the Depth First Search Algorithm in Supercritical Random Graphs

Abstract

We consider the performance of the Depth First Search (DFS) algorithm on the random graph $G\left(n,\frac{1+\epsilon}{n}\right)$, $\epsilon>0$ a small constant. Recently, Enriquez, Faraud and Ménard proved that the stack $U$ of the DFS follows a specific scaling limit, reaching the maximal height of $\left(1+o_{\epsilon}(1)\right)\epsilon^2n$. Here we provide a simple analysis for the typical length of a maximum path discovered by the DFS.