Optimal randomized EREW PRAM algorithms for finding spanning forests (Q2731600)
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: Optimal randomized EREW PRAM algorithms for finding spanning forests |
scientific article; zbMATH DE number 1626166
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal randomized EREW PRAM algorithms for finding spanning forests |
scientific article; zbMATH DE number 1626166 |
Statements
20 September 2001
0 references
Euler tours
0 references
Eulerian graphs
0 references
Optimal randomized EREW PRAM algorithms for finding spanning forests (English)
0 references
0.8993499875068665
0 references
0.882922351360321
0 references
0.8502179384231567
0 references
