Limiting shape of the depth first search tree in an Erdős‐Rényi graph

DOI10.1002/rsa.20878zbMath1436.05096arXiv1704.00696OpenAlexW3105352506MaRDI QIDQ5113947

Nathanaël Enriquez, Gabriel Faraud, Laurent Ménard

Publication date: 19 June 2020

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1704.00696

zbMATH Keywords

Erdős-Rényi graphsdepth first search algorithm

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items

Depth first exploration of a configuration model ⋮ Respondent-driven sampling on sparse Erdös-Rényi graphs ⋮ Depth-first search performance in a random digraph with geometric outdegree distribution ⋮ Chain-referral sampling on stochastic block models ⋮ On the performance of the depth first search algorithm in supercritical random graphs

This page was built for publication: Limiting shape of the depth first search tree in an Erdős‐Rényi graph