3 citations · 7 across the 8 of their papers we have counts for
4 papers · 1 filter
Improved Massively Parallel Shortest Path Computation
Yi-Jun Chang, Shaun Quek
We present new algorithms for approximate shortest path computation in weighted undirected graphs within the Massively Parallel Computation (MPC) model. Specifically, we construct…
Introvert Clustering for Distributed Graph Algorithms
Yi-Jun Chang, Nima Dolatabadi
We introduce a graph decomposition primitive called introvert clustering, which strengthens standard low-diameter clustering by guaranteeing that every clustered vertex keeps at le…
A Few Shared Random Bits Suffice for Constant-Round Almost Stable Matching
Yi-Jun Chang, Kushagra Chatterjee
We show that almost stable matching can be solved in constant distributed rounds on general bipartite graphs using only a few shared random bits. Specifically, in the $\c…
Local Certification of Vertex and Edge Connectivity
Yi-Jun Chang, Yi-Xuan Lee, Meng-Tsung Tsai
Local certification is a framework for verifying global graph properties using only local information. In this model, a prover assigns short labels, called certificates, to the ver…