Variations on depth-first search performance in random digraphs - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2023

Variations on depth-first search performance in random digraphs

Résumé

We present an analysis of the depth-first search algorithm in a random digraph model with geometric outdegree distribution. This problem posed by Don Knuth in his next to appear volume of The Art of Computer Programming gives interesting insight in one of the most elegant and efficient algorithm for graph analysis due to Tarjan.
Fichier principal
Vignette du fichier
Random_Digraph_extended.pdf (400.42 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03537124 , version 1 (20-01-2022)

Identifiants

  • HAL Id : hal-03537124 , version 1

Citer

Philippe Jacquet, Svante Janson. Variations on depth-first search performance in random digraphs. AofA 2022 - 33rd International Conference on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms, Jun 2022, Philadelphia, PA, United States. ⟨hal-03537124⟩
55 Consultations
62 Téléchargements

Partager

Gmail Facebook X LinkedIn More