From the 1 of 4 linked papers with an AI index.
4 papers
The Complexity of Distributed Minimum Weight Cycle Approximation
Yi-Jun Chang, Yanyu Chen, Dipan Dey +4
The paper presents randomized approximation algorithms for the Minimum Weight Cycle problem in the CONGEST model, achieving a trade‑off between approximation ratio and round comple…
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 $…
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…
A Tight Lower Bound for 3-Coloring Grids in the Online-LOCAL Model
Yi-Jun Chang, Gopinath Mishra, Hung Thuan Nguyen +2
Recently, \citeauthor*{akbari2021locality}~(ICALP 2023) studied the locality of graph problems in distributed, sequential, dynamic, and online settings from a {unified} point of vi…