Optimal reachability and a space-time tradeoff for distance queries in constant-treewidth graphs (Q4606297)
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 6846399
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal reachability and a space-time tradeoff for distance queries in constant-treewidth graphs |
scientific article; zbMATH DE number 6846399 |
Statements
2 March 2018
0 references
graph algorithms
0 references
constant-treewidth graphs
0 references
reachability queries
0 references
distance queries
0 references
Optimal Reachability and a Space-Time Tradeoff for Distance Queries in Constant-Treewidth Graphs (English)
0 references
0.8232259750366211
0 references
0.8219078183174133
0 references
0.8110477924346924
0 references
0.7939481139183044
0 references
0.786996603012085
0 references
