3 citations · 6 across the 26 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
math.CO2021
On the Performance of the Depth First Search Algorithm in Supercritical Random Graphs
Sahar Diskin, Michael Krivelevich
We consider the performance of the Depth First Search (DFS) algorithm on the random graph , a small constant. Recently, Enriquez, Faraud and Mé…
math.CO2021★ 1 cited
Site Percolation on Pseudo-Random Graphs
Sahar Diskin, Michael Krivelevich
We consider vertex percolation on pseudo-random regular graphs. The previous study by the second author established the existence of phase transition from small components to a…