O’Reach: Even Faster Reachability in Large Graphs (Q6127828)
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: O’Reach: Even Faster Reachability in Large Graphs |
scientific article; zbMATH DE number 7832061
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | O’Reach: Even Faster Reachability in Large Graphs |
scientific article; zbMATH DE number 7832061 |
Statements
O’Reach: Even Faster Reachability in Large Graphs (English)
0 references
14 April 2024
0 references
reachability
0 references
static graphs
0 references
graph algorithms
0 references
reachability index
0 references
algorithm engineering
0 references
0.9957724809646606
0 references
0.8237071633338928
0 references
0.789824366569519
0 references
0.776821494102478
0 references
