Yi-Jun Chang

works on

approximation algorithms 1 congest model 1 lower bounds 1 minimum weight cycle 1 round complexity 1

From the 1 of 4 linked papers with an AI index.

collaborators

Showing cs.DSShow all

2 papers · 1 filter

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.DS2025

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 $n$ -vertex graphs $G$ with a maximum degre…