Keerti Choudhary

collaborators

5 papers

cs.DS2026

Fault-Tolerant ST-Diameter Oracles

Davide BilÃ², Keerti Choudhary, Sarel Cohen +3

Given two vertex sets $S$ and $T$ in a graph, the $S T$ -diameter is the maximum $s$ - $t$ -distance between vertices $s \in S$ and $t \in T$ . We study the problem of estimating the $ST…

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 $I^$ , 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 $(I^\pm, I^^{2})$ 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

Approximate Distance Sensitivity Oracles in Subquadratic Space

Davide BilÃ², Shiri Chechik, Keerti Choudhary +4

An $f$ -edge fault-tolerant distance sensitive oracle ( $f$ -DSO) with stretch $I ¨ \geq 1$ is a data structure that preprocesses a given undirected, unweighted graph $G$ with $n$ vertic…

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…