First deterministic subquadratic partially-dynamic algorithm for approximate APSP in directed graphs using reliable hub sets.
Randomized dy namic graph algorithms with poly- logarithmic time per operation
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Reliable Hubs for Partially-Dynamic All-Pairs Shortest Paths in Directed Graphs
First deterministic subquadratic partially-dynamic algorithm for approximate APSP in directed graphs using reliable hub sets.