Parallel algorithms for a depth first search and a breadth first search (Q3802639): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1080/00207168608803503 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2049713017 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Fast parallel sorting algorithms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Parallel Matrix and Graph Algorithms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Parallel breadth-first search algorithms for trees and graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3885184 / rank | |||
Normal rank | |||
Latest revision as of 19:11, 18 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parallel algorithms for a depth first search and a breadth first search |
scientific article |
Statements
Parallel algorithms for a depth first search and a breadth first search (English)
0 references
1986
0 references
parallel algorithm
0 references
serial algorithm
0 references
time complexity
0 references
shortest path algorithm
0 references
breadth first search
0 references
depth first search
0 references
