Planar Depth-First Search in $O(\log n)$ Parallel Time (Q3474884): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 22:26, 4 February 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
