Efficient Parallel Algorithms for a Class of Graph Theoretic Problems (Q3335006)
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: Efficient Parallel Algorithms for a Class of Graph Theoretic Problems |
scientific article; zbMATH DE number 3868637
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient Parallel Algorithms for a Class of Graph Theoretic Problems |
scientific article; zbMATH DE number 3868637 |
Statements
Efficient Parallel Algorithms for a Class of Graph Theoretic Problems (English)
0 references
1984
0 references
parallel computation
0 references
analysis of algorithms
0 references
graph algorithms
0 references
directed spanning forests
0 references
lowest common ancestors
0 references
fundamental cycles
0 references
bridge- connected components
0 references
separation vertices
0 references
biconnected components
0 references
SIMD machines
0 references
PRAM
0 references
efficient parallel algorithms
0 references
0.9149662256240844
0 references
0.8769140839576721
0 references
0.8668597936630249
0 references
0.863724410533905
0 references
