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

Sahar Diskin, Michael Krivelevich

Research output: Contribution to journalArticlepeer-review

2 Scopus citations

Abstract

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.

Original languageEnglish
Article numberP3.64
JournalElectronic Journal of Combinatorics
Volume29
Issue number3
DOIs
StatePublished - 2022

Funding

FundersFunder number
USA-Israel BSF2018267, 1261/17
Israel Science Foundation

    Fingerprint

    Dive into the research topics of 'On the Performance of the Depth First Search Algorithm in Supercritical Random Graphs'. Together they form a unique fingerprint.

    Cite this