Maintaining shortest paths under deletions in weighted directed graphs (Q2805514)
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 6579503
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Maintaining shortest paths under deletions in weighted directed graphs |
scientific article; zbMATH DE number 6579503 |
Statements
12 May 2016
0 references
graph algorithms
0 references
dynamic algorithms
0 references
approximation
0 references
shortest paths
0 references
0 references
0 references
0 references
0 references
Maintaining shortest paths under deletions in weighted directed graphs (English)
0 references
0.993094801902771
0 references
0.8904784321784973
0 references
0.8893982768058777
0 references
0.8782147169113159
0 references
