From the 1 of 5 linked papers with an AI index.
5 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…
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.…
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…
Arboricity and Random Edge Queries Matter for Triangle Counting using Sublinear Queries
Arijit Bishnu, Debarshi Chanda, Gopinath Mishra
Given a simple, unweighted, undirected graph with and , and parameters , along with \texttt{Degree}, \texttt{Neighbour}, \texttt{Edg…