Semi-robust communication complexity of maximum matching

DOI10.1137/1.9781611978964.15MaRDI QIDQ7292276zbMATH OpenFDO

Authors Gabriel Cipriani Huete, Adithya Diddapur, Pavel Dvořák, Christian Konrad

Publication date 8 July 2026

Full work available at URL https://doi.org/10.1137/1.9781611978964.15

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

This page was built for publication: Semi-robust communication complexity of maximum matching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7292276)