A Nearly Optimal Parallel Algorithm for Constructing Depth First Spanning Trees in Planar Graphs (Q3798262)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A Nearly Optimal Parallel Algorithm for Constructing Depth First Spanning Trees in Planar Graphs |
scientific article; zbMATH DE number 4064513
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Nearly Optimal Parallel Algorithm for Constructing Depth First Spanning Trees in Planar Graphs |
scientific article; zbMATH DE number 4064513 |
Statements
A Nearly Optimal Parallel Algorithm for Constructing Depth First Spanning Trees in Planar Graphs (English)
0 references
1988
0 references
parallel algorithm
0 references
depth first spanning trees
0 references
planar graphs
0 references
PRAM
0 references
0.9137347936630248
0 references
0.9051443934440612
0 references
0.8961184024810791
0 references
0.886016845703125
0 references
0.873828113079071
0 references
