Faster centralized and parallel algorithms for multi-source reachability and approximate distances in directed graphs using shortcuts, hopsets, and rectangular matrix multiplication.
To define this sequence, we start with defining A0 = B0 = C0 = ϕ, D0 = V
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Faster Multi-Source Reachability and Approximate Distances via Shortcuts, Hopsets and Matrix Multiplication
Faster centralized and parallel algorithms for multi-source reachability and approximate distances in directed graphs using shortcuts, hopsets, and rectangular matrix multiplication.