Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs (Q5259603)
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 6451597
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs |
scientific article; zbMATH DE number 6451597 |
Statements
Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs (English)
0 references
26 June 2015
0 references
dynamic graph algorithms
0 references
reachability
0 references
shortest paths
0 references
0 references
0 references
0.903160810470581
0 references
0.8975274562835693
0 references
0.8917256593704224
0 references
0.8884128928184509
0 references
