Probabilistic analysis of a parallel algorithm for finding the lexicographically first depth first search tree in a dense random graph (Q3357536)
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: Probabilistic analysis of a parallel algorithm for finding the lexicographically first depth first search tree in a dense random graph |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Probabilistic analysis of a parallel algorithm for finding the lexicographically first depth first search tree in a dense random graph |
scientific article |
Statements
Probabilistic analysis of a parallel algorithm for finding the lexicographically first depth first search tree in a dense random graph (English)
0 references
1991
0 references
lexicographically first depth first search tree
0 references
random graph
0 references
