collaborators

1 paper

cs.DS2025

Semi-Robust Communication Complexity of Maximum Matching

Gabriel Cipriani Huete, Adithya Diddapur, Pavel Dvořák +1

We study the one-way two-party communication complexity of Maximum Matching in the semi-robust setting where the edges of a maximum matching are randomly partitioned between Alice…