Deterministic Õ(n^{ω(σ)}) time algorithm for multi-source reachability in digraphs with n^σ sources, improving prior randomized n^{1+2/3ω(σ)} bound.
Cranston and Landon Rabern , title =
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Graphs of bounded VC-dimension have sub-linear twin-width, shown via a new contraction tool on neighborhood partitions, plus tighter bounds for interval graphs.
citing papers explorer
-
The Twin-Width of Graphs of Bounded VC-Dimension
Graphs of bounded VC-dimension have sub-linear twin-width, shown via a new contraction tool on neighborhood partitions, plus tighter bounds for interval graphs.