3 papers
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 $…
cs.DS2024
Round and Communication Efficient Graph Coloring
Yi-Jun Chang, Gopinath Mishra, Hung Thuan Nguyen +1
In the context of communication complexity, we explore protocols for graph coloring, focusing on the vertex and edge coloring problems in -vertex graphs with a maximum degre…
cs.DC2024
Overlay Network Construction: Improved Overall and Node-Wise Message Complexity
Yi-Jun Chang, Yanyu Chen, Gopinath Mishra
We consider the problem of constructing distributed overlay networks, where nodes in a reconfigurable system can create or sever connections with nodes whose identifiers they know.…