2 citations · 2 across the 3 of their papers we have counts for
Showing cs.DCShow all
3 papers · 1 filter
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.DC2023★ 2 cited
Improved Tradeoffs for Leader Election
Shay Kutten, Peter Robinson, Ming Ming Tan +1
We consider leader election in clique networks, where nodes are connected by point-to-point communication links. For the synchronous clique under simultaneous wake-up, i.e., wh…