Efficient single-pair all-shortest-path query processing for massive dynamic networks (Q2055599)
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 single-pair all-shortest-path query processing for massive dynamic networks |
scientific article; zbMATH DE number 7436910
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient single-pair all-shortest-path query processing for massive dynamic networks |
scientific article; zbMATH DE number 7436910 |
Statements
Efficient single-pair all-shortest-path query processing for massive dynamic networks (English)
0 references
1 December 2021
0 references
graph query processing
0 references
shortest paths
0 references
incremental maintenance
0 references
0.8824768
0 references
0.8809863
0 references
0.8758666
0 references
0 references
0.8641022
0 references
