Maintaining shortest paths under deletions in weighted directed graphs (Q5495843)
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 6327007
| 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 6327007 |
Statements
Maintaining shortest paths under deletions in weighted directed graphs (English)
0 references
7 August 2014
0 references
approximation algorithms
0 references
dynamic algorithms
0 references
shortest paths
0 references
0.98956555
0 references
0.89834774
0 references
0.87702066
0 references
0.8755995
0 references
0.8649551
0 references
0 references
0 references
