On depth first search trees in \(m\)-out digraphs (Q684408)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On depth first search trees in m-out digraphs |
scientific article; zbMATH DE number 411702
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On depth first search trees in \(m\)-out digraphs |
scientific article; zbMATH DE number 411702 |
Statements
On depth first search trees in \(m\)-out digraphs (English)
0 references
15 September 1993
0 references
\(m\)-out digraphs
0 references
depth first search
0 references
trees
0 references
random digraphs
0 references
DFS tree
0 references
0.7762793898582458
0 references
0.7612313628196716
0 references
0.7583948969841003
0 references
0.7212516069412231
0 references
0.7175486087799072
0 references
