TY - JOUR
T1 - On the Performance of the Depth First Search Algorithm in Supercritical Random Graphs
AU - Diskin, Sahar
AU - Krivelevich, Michael
N1 - Publisher Copyright:
© The authors.
PY - 2022
Y1 - 2022
N2 - We consider the performance of the Depth First Search (DFS) algorithm on the random graph G( n,1+ɛ) n, ɛ > 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 (1 + oɛ (1)) ɛ2 n. Here we provide a simple analysis for the typical length of a maximum path discovered by the DFS.
AB - We consider the performance of the Depth First Search (DFS) algorithm on the random graph G( n,1+ɛ) n, ɛ > 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 (1 + oɛ (1)) ɛ2 n. Here we provide a simple analysis for the typical length of a maximum path discovered by the DFS.
UR - http://www.scopus.com/inward/record.url?scp=85138347345&partnerID=8YFLogxK
U2 - 10.37236/10894
DO - 10.37236/10894
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:85138347345
SN - 0022-5282
VL - 29
JO - Electronic Journal of Combinatorics
JF - Electronic Journal of Combinatorics
IS - 3
M1 - P3.64
ER -