Keerti Choudhary

collaborators

3 papers

cs.DS2026

Simpler and Improved Replacement Path Coverings

Davide Bilò, Shiri Chechik, Keerti Choudhary +2

An important tool in the design of fault-tolerant graph data structures are $(L, f)$ -replacement path coverings (RPCs). An RPC is a family $G$ of subgraphs of a given grap…

cs.DS2025

Maximum-Flow and Minimum-Cut Sensitivity Oracles for Directed Graphs

Mridul Ahi, Keerti Choudhary, Shlok Pande +2

Given a digraph $G = (V, E)$ with a designated source $s$ , sink $t$ , and an $(s, t)$ -max-flow of value $λ$ , we present constructions for max-flow and min-cut sensitivity oracles, an…

cs.DS2025

Efficient Algorithms for Disjoint Shortest Paths Problem and its Extensions

Keerti Choudhary, Amit Kumar, Lakshay Saggi

We study the 2-Disjoint Shortest Paths (2-DSP) problem: given a directed weighted graph and two terminal pairs $(s_{1}, t_{1})$ and $(s_{2}, t_{2})$ , decide whether there exist vertex-disjoi…