Showing 2026Show all
2 papers · 1 filter
cs.DS2026
Low-Cost Arborescence Under Edge Faults
Dipan Dey, Telikepalli Kavitha
Our input is a directed graph on vertices and edges with a designated root vertex and a function . The problem is t…
cs.DC2026
The Complexity of Distributed Minimum Weight Cycle Approximation
Yi-Jun Chang, Yanyu Chen, Dipan Dey +4
We study the Minimum Weight Cycle (MWC) problem in the model of distributed computing. For undirected weighted graphs, we give a randomized -approximation…