An optimal EREW parallel algorithm for computing breadth-first search trees on permutation graphs (Q290218): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 23:56, 4 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An optimal EREW parallel algorithm for computing breadth-first search trees on permutation graphs |
scientific article |
Statements
An optimal EREW parallel algorithm for computing breadth-first search trees on permutation graphs (English)
0 references
1 June 2016
0 references
parallel algorithms
0 references
permutation graphs
0 references
breadth-first search trees
0 references
