An optimal EREW parallel algorithm for computing breadth-first search trees on permutation graphs (Q290218): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Efficient parallel algorithms for permutation graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3328583 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4023519 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Efficient algorithms for finding depth-first and breadth-first search trees in permutation graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Efficient Parallel Biconnectivity Algorithm / rank | |||
Normal rank | |||
Revision as of 01:57, 12 July 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
0 references
