pith. sign in

Closing the Gap Between Directed Hopsets and Shortcut Sets , booktitle =

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it

fields

cs.DS 1

years

2026 1

verdicts

UNVERDICTED 1

clear filters

representative citing papers

Multi-Source Reachability in Near-Optimal Time

cs.DS · 2026-06-24 · unverdicted · novelty 7.0

Deterministic Õ(n^{ω(σ)}) time algorithm for multi-source reachability in digraphs with n^σ sources, improving prior randomized n^{1+2/3ω(σ)} bound.

citing papers explorer

Showing 1 of 1 citing paper after filters.

  • Multi-Source Reachability in Near-Optimal Time cs.DS · 2026-06-24 · unverdicted · none · ref 21

    Deterministic Õ(n^{ω(σ)}) time algorithm for multi-source reachability in digraphs with n^σ sources, improving prior randomized n^{1+2/3ω(σ)} bound.