Keerti Choudhary

activity

20112026

most citedDynamic DFS Tree in Undirected Graphs: breaking the

O (m)

barrier

14 citations · 19 across the 13 of their papers we have counts for

collaborators

Showing 2024Show all

3 papers · 1 filter

cs.DS2024

Efficient Fault-Tolerant Search by Fast Indexing of Subnetworks

Davide Bilò, Keerti Choudhary, Sarel Cohen +2

We design sensitivity oracles for error-prone networks. For a network problem $Π$ , the data structure preprocesses a network $G = (V, E)$ and sensitivity parameter $f$ such that, for…

cs.DS2024

Improved Distance (Sensitivity) Oracles with Subquadratic Space

Davide Bilò, Shiri Chechik, Keerti Choudhary +3

A distance oracle (DO) with stretch $(α, β)$ for a graph $G$ is a data structure that, when queried with vertices $s$ and $t$ , returns a value $d (s, t)$ such that $d(s,t)…

cs.DS2024

Fault-Tolerant Bounded Flow Preservers

Shivam Bansal, Keerti Choudhary, Harkirat Dhanoa +1

Given a directed graph $G = (V, E)$ with $n$ vertices, $m$ edges and a designated source vertex $s \in V$ , we consider the question of finding a sparse subgraph $H$ of $G$ that pres…