Chhaya Trehan

collaborators

2 papers

cs.DS2026

Faster Multi-Source Reachability and Approximate Distances via Shortcuts, Hopsets and Matrix Multiplication

Michael Elkin, Chhaya Trehan

Given an $n$ -vertex $m$ -edge digraph $G = (V, E)$ and a subset $S \subseteq V$ of $∣ S ∣ = n^{I ¨} $ (for some $0 \leq I ¨ \leq 1$ ) designated sources, the $S \times V$ reachability problem i…

cs.DS2025

Constructing Long Paths in Graph Streams

Christian Konrad, Chhaya Trehan

In the graph stream model of computation, an algorithm processes the edges of an input graph in one or more sequential passes while using a memory sublinear in the input size. This…