Reliable Hubs for Partially-Dynamic All-Pairs Shortest Paths in Directed Graphs (Q5075810)
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 7525502
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Reliable Hubs for Partially-Dynamic All-Pairs Shortest Paths in Directed Graphs |
scientific article; zbMATH DE number 7525502 |
Statements
11 May 2022
0 references
shortest paths
0 references
dynamic
0 references
incremental
0 references
decremental
0 references
directed graphs
0 references
hubs
0 references
0 references
0 references
0 references
0 references
Reliable Hubs for Partially-Dynamic All-Pairs Shortest Paths in Directed Graphs (English)
0 references
0.8367414474487305
0 references
0.8354083299636841
0 references
0.8294132351875305
0 references
0.8279648423194885
0 references
0.8238450884819031
0 references
