Two parallel algorithms for finding all minimal maximum subsequences (Q2424687)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Two parallel algorithms for finding all minimal maximum subsequences |
scientific article |
Statements
Two parallel algorithms for finding all minimal maximum subsequences (English)
0 references
25 June 2019
0 references
maximum subsequences
0 references
parallel algorithm
0 references
parallel random-access machine
0 references
random walk
0 references
message-passing interface
0 references
0 references
0 references
0 references
