Disk-based shortest path discovery using distance index over large dynamic graphs (Q2292955)
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 7164113
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Disk-based shortest path discovery using distance index over large dynamic graphs |
scientific article; zbMATH DE number 7164113 |
Statements
Disk-based shortest path discovery using distance index over large dynamic graphs (English)
0 references
6 February 2020
0 references
dynamic graphs
0 references
graph searching
0 references
large graphs
0 references
shortest path discovery
0 references
0 references
0.7913695573806763
0 references
0.7691230177879333
0 references
0.7504295110702515
0 references
0.7449777126312256
0 references
0.7383845448493958
0 references
