Parallelism, Preprocessing, and Reachability: A Hybrid Algorithm for Directed Graphs (Q4696644)
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 221084
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parallelism, Preprocessing, and Reachability: A Hybrid Algorithm for Directed Graphs |
scientific article; zbMATH DE number 221084 |
Statements
Parallelism, Preprocessing, and Reachability: A Hybrid Algorithm for Directed Graphs (English)
0 references
29 June 1993
0 references
hybrid algorithm
0 references
reachability
0 references
directed graph
0 references
parallelization
0 references
sparse graphs
0 references
preprocessing
0 references
0.8353145122528076
0 references
0.8033402562141418
0 references
0.8010473847389221
0 references
0.7801858186721802
0 references
