An optimal EREW parallel algorithm for computing breadth-first search trees on permutation graphs (Q290218): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68W10 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68P05 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68R10 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6588294 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
parallel algorithms | |||
| Property / zbMATH Keywords: parallel algorithms / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
permutation graphs | |||
| Property / zbMATH Keywords: permutation graphs / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
breadth-first search trees | |||
| Property / zbMATH Keywords: breadth-first search trees / rank | |||
Normal rank | |||
Revision as of 19:36, 27 June 2023
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
