pith. sign in

Title resolution pending

Arnab Bhattacharyya, Elena Grigorescu, Kyomin Jung, Sofya Raskhodnikova, David P · 2012 · DOI 10.1137/110826655

2 Pith papers cite this work. Polarity classification is still indexing.

2 Pith papers citing it
open at publisher browse 2 citing papers

Title metadata for this work has not finished resolving. The hub is built from the citation graph; the title resolver retries DOI and OpenAlex on its next pass.

fields

cs.DS 2

years

2026 2

verdicts

UNVERDICTED 2

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.

Revisiting Diameter in Directed Graphs

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

The paper shows fine-grained hardness for approximating reachability diameter in directed graphs, gives additive approximations for unweighted cases, and constant-factor approximations for bounded treewidth and width-bounded DAGs.

citing papers explorer

Showing 2 of 2 citing papers after filters.

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

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

  • Revisiting Diameter in Directed Graphs cs.DS · 2026-06-06 · unverdicted · none · ref 10

    The paper shows fine-grained hardness for approximating reachability diameter in directed graphs, gives additive approximations for unweighted cases, and constant-factor approximations for bounded treewidth and width-bounded DAGs.