Probabilistic analysis of a parallel algorithm for finding the lexicographically first depth first search tree in a dense random graph (Q56324108)
article by Martin Dyer & Alan Friezet published 5 July 2007 in Random Structures and Algorithms
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Probabilistic analysis of a parallel algorithm for finding the lexicographically first depth first search tree in a dense random graph |
article by Martin Dyer & Alan Friezet published 5 July 2007 in Random Structures and Algorithms |
Statements
Probabilistic analysis of a parallel algorithm for finding the lexicographically first depth first search tree in a dense random graph (English)
0 references
5 July 2007
0 references
2
0 references
2
0 references
233-239
0 references
