Planar Depth-First Search in $O(\log n)$ Parallel Time (Q3474884): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/0219047 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2023670982 / rank | |||
Normal rank | |||
Latest revision as of 00:55, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Planar Depth-First Search in $O(\log n)$ Parallel Time |
scientific article |
Statements
Planar Depth-First Search in $O(\log n)$ Parallel Time (English)
0 references
1990
0 references
parallel computing
0 references
Priority CRCW PRAM
0 references
planar graphs
0 references
depth-first search
0 references
