Abstract
We will present several sparsification approaches beneficial for designing algorithms in the CONGEST model, with a particular focus on local symmetry-breaking problems such as graph coloring, ruling sets, and the Lovász Local Lemma.
We will present several sparsification approaches beneficial for designing algorithms in the CONGEST model, with a particular focus on local symmetry-breaking problems such as graph coloring, ruling sets, and the Lovász Local Lemma.