Parallel graph algorithms that are efficients on average (Q1825648)
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: Parallel graph algorithms that are efficients on average |
scientific article; zbMATH DE number 4121426
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parallel graph algorithms that are efficients on average |
scientific article; zbMATH DE number 4121426 |
Statements
Parallel graph algorithms that are efficients on average (English)
0 references
1989
0 references
average case analysis
0 references
parallel algorithms
0 references
model of computation
0 references
CRCW PRAM
0 references
random graphs
0 references
