An 0(log n) parallel algorithm for strong connectivity augmentation problem (Q3804208)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An 0(log n) parallel algorithm for strong connectivity augmentation problem |
scientific article |
Statements
An 0(log n) parallel algorithm for strong connectivity augmentation problem (English)
0 references
1987
0 references
CRCW PRAM
0 references
time complexity
0 references
parallel algorithm
0 references
strong connectivity
0 references
augmentation
0 references
parallel random access machine
0 references
