Improved Network Decompositions using Small Messages with Applications on MIS, Neighborhood Covers, and Beyond

9 August 2019

Papers citing "Improved Network Decompositions using Small Messages with Applications on MIS, Neighborhood Covers, and Beyond"

8 / 8 papers shown

Title
Average Awake Complexity of MIS and Matching M. Ghaffari Julian Portmann 48 13 0 10 May 2023
Reducing Maximum Weighted Matching to the Largest Cardinality Matching in CONGEST V. Mkrtchyan 79 0 0 03 Jan 2023
A Simple Deterministic Distributed Low-Diameter Clustering Václav Rozhon Bernhard Haeupler Christoph Grunau 50 1 0 21 Oct 2022
Efficient CONGEST Algorithms for the Lovasz Local Lemma Yannic Maus Jara Uitto 55 10 0 05 Aug 2021
Improved Distributed Lower Bounds for MIS and Bounded (Out-)Degree Dominating Sets in Trees Alkida Balliu S. Brandt Fabian Kuhn Dennis Olivetti 42 18 0 04 Jun 2021
Coloring Fast Without Learning Your Neighbors' Colors Magnús M. Halldórsson Fabian Kuhn Yannic Maus Alexandre Nolin 63 10 0 10 Aug 2020
Improved Deterministic Network Decomposition M. Ghaffari Christoph Grunau Václav Rozhon 56 82 0 16 Jul 2020
Distributed Lower Bounds for Ruling Sets Alkida Balliu S. Brandt Dennis Olivetti 49 41 0 17 Apr 2020