Depth-first search performance in a random digraph with geometric outdegree distribution (Q6130352)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7826838
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Depth-first search performance in a random digraph with geometric outdegree distribution |
scientific article; zbMATH DE number 7826838 |
Statements
Depth-first search performance in a random digraph with geometric outdegree distribution (English)
0 references
2 April 2024
0 references
depth-first search
0 references
depth-first forest
0 references
random digraph
0 references
search depth
0 references
depth profile
0 references
height
0 references
0.8606406450271606
0 references
0.8300527930259705
0 references
0.7859621047973633
0 references
0.7681307792663574
0 references
