3 papers
cs.DC2025
Dynamic Approximate Maximum Matching in the Distributed Vertex Partition Model
Peter Robinson, Xianbin Zhu
We initiate the study of approximate maximum matching in the vertex partition model, for graphs subject to dynamic changes. We assume that the vertices of the graph are partiti…
cs.DC2024
Dynamic Maximal Matching in Clique Networks
Minming Li, Peter Robinson, Xianbin Zhu
We consider the problem of computing a maximal matching with a distributed algorithm in the presence of batch-dynamic changes to the graph topology. We assume that a graph of n…
cs.DS2023
Massively Parallel Algorithms for the Stochastic Block Model
Zelin Li, Pan Peng, Xianbin Zhu
Learning the community structure of a large-scale graph is a fundamental problem in machine learning, computer science and statistics. We study the problem of exactly recovering th…