A single-source shortest path algorithm for dynamic graphs (Q4956230)
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 7389452
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A single-source shortest path algorithm for dynamic graphs |
scientific article; zbMATH DE number 7389452 |
Statements
A single-source shortest path algorithm for dynamic graphs (English)
0 references
1 September 2021
0 references
dynamic graphs
0 references
shortest paths
0 references
SSSP
0 references
0.9186184406280518
0 references
0.7903781533241272
0 references
0.7876878380775452
0 references
0.7598965167999268
0 references
