Showing cs.DCShow all
2 papers · 1 filter
cs.DC2020
Distributed Maximum Matching Verification in CONGEST
Mohamad Ahmadi, Fabian Kuhn
We study the maximum cardinality matching problem in a standard distributed setting, where the nodes of a given -node network graph communicate over the edges …
cs.DC2018
The Communication Cost of Information Spreading in Dynamic Networks
Mohamad Ahmadi, Fabian Kuhn, Shay Kutten +2
This paper investigates the message complexity of distributed information spreading (a.k.a gossip or token dissemination) in adversarial dynamic networks, where the goal is to spre…