First deterministic subquadratic partially-dynamic algorithm for approximate APSP in directed graphs using reliable hub sets.
Near-optimal fully-dynamic graph conn ectivity
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.DS 2verdicts
UNVERDICTED 2representative citing papers
Hybrid sketching saves up to 97% space on dense graphs and 15% on sparse ones by sketching dense cores and storing sparse parts exactly, with new BalloonSketch reducing sketch sizes up to 8x.
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.
-
Hybrid Sketching Methods for Dynamic Connectivity on Sparse Graphs
Hybrid sketching saves up to 97% space on dense graphs and 15% on sparse ones by sketching dense cores and storing sparse parts exactly, with new BalloonSketch reducing sketch sizes up to 8x.