Parallel Algorithms for Depth-First Searches I. Planar Graphs (Q3753502)
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: Parallel Algorithms for Depth-First Searches I. Planar Graphs |
scientific article; zbMATH DE number 3990886
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parallel Algorithms for Depth-First Searches I. Planar Graphs |
scientific article; zbMATH DE number 3990886 |
Statements
Parallel Algorithms for Depth-First Searches I. Planar Graphs (English)
0 references
1986
0 references
inherently sequential problems
0 references
unbounded-parallel algorithm
0 references
depth-first search
0 references
planar undirected graph
0 references
depth-first spanning tree
0 references
0 references
0.9385832
0 references
0.93659693
0 references
0.9346256
0 references
0.9322695
0 references
0.9225067
0 references
0.9186317
0 references
0.9168854
0 references
