Planar Depth-First Search in $O(\log n)$ Parallel Time (Q3474884)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4143432
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Planar Depth-First Search in $O(\log n)$ Parallel Time |
scientific article; zbMATH DE number 4143432 |
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
0.9388572
0 references
0.9385832
0 references
0.9051314
0 references
0.9047513
0 references
0 references
0 references
0 references
0.8994974
0 references
0.8980594
0 references
