When MIS and Maximal Matching are Easy in the Congested Clique

Keren Censor-Hillel, Tomer Even, Maxime Flin +1

Two of the most fundamental distributed symmetry-breaking problems are that of finding a maximal independent set (MIS) and a maximal matching (MM) in a graph. It is a major open qu…