Dipan Dey

activity

20242026

collaborators

Showing cs.DSShow all

5 papers · 1 filter

cs.DS2026

Low-Cost Arborescence Under Edge Faults

Dipan Dey, Telikepalli Kavitha

Our input is a directed graph $G = (V, E)$ on $n$ vertices and $m$ edges with a designated root vertex $r$ and a function $cos t : E \to R_{\geq 0}$ . The problem is t…

cs.DS2025

Fault-Tolerant Approximate Distance Oracles with a Source Set

Dipan Dey, Telikepalli Kavitha

Our input is an undirected weighted graph $G = (V, E)$ on $n$ vertices along with a source set $S \subseteq V$ . The problem is to preprocess $G$ and build a compact data structure su…

cs.DS2025

Optimal Distributed Replacement Paths

Yi-Jun Chang, Yanyu Chen, Dipan Dey +3

We study the replacement paths problem in the $CONGEST$ model of distributed computing. Given an $s$ - $t$ shortest path $P$ , the goal is to compute, for every edge $e$ in $…

cs.DS2024

Near Optimal Dual Fault Tolerant Distance Oracle

Dipan Dey, Manoj Gupta

We present a dual fault-tolerant distance oracle for undirected and unweighted graphs. Given a set $F$ of two edges, as well as a source node $s$ and a destination node $t$ , our or…

cs.DS2024

Nearly Optimal Fault Tolerant Distance Oracle

Dipan Dey, Manoj Gupta

We present an $f$ -fault tolerant distance oracle for an undirected weighted graph where each edge has an integral weight from $[1 \dots W]$ . Given a set $F$ of $f$ edges, as well a…