Showing 2025 · cs.DSShow all
2 papers · 2 filters
cs.DS2025
Fault-Tolerant Approximate Distance Oracles with a Source Set
Dipan Dey, Telikepalli Kavitha
Our input is an undirected weighted graph on vertices along with a source set . The problem is to preprocess 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 model of distributed computing. Given an - shortest path , the goal is to compute, for every edge in $…