A Nearly Linear-Time Distributed Algorithm for Exact Maximum Matching

v1v2 (latest)

A Nearly Linear-Time Distributed Algorithm for Exact Maximum Matching

7 November 2023

Yutaro Yamaguchi

ArXiv (abs)PDF HTML

Papers citing "A Nearly Linear-Time Distributed Algorithm for Exact Maximum Matching"

6 / 6 papers shown

Title
$Narrowing the LOCAL$\unicode{x2013}$CONGEST Gaps in Sparse Networks via Expander Decompositions$ Narrowing the LOCAL $\unicode{x2013}$ CONGEST Gaps in Sparse Networks via Expander Decompositions Yi-Jun Chang Hsin-Hao Su 92 10 0 17 May 2022
A Subquadratic-Time Distributed Algorithm for Exact Maximum Matching Naoki Kitamura Taisuke Izumi 55 5 0 25 Apr 2021
Distributed Maximum Matching Verification in CONGEST Mohamad Ahmadi Fabian Kuhn 57 7 0 18 Feb 2020
Hardness of Distributed Optimization Nir Bachrach K. Censor-Hillel Michal Dory Yuval Efron Dean Leitersdorf A. Paz 46 41 0 24 May 2019
Parameterized Distributed Algorithms Ran Ben-Basat Ken-ichi Kawarabayashi Gregory Schwartzman 46 14 0 13 Jul 2018
Distributed Approximation of Maximum Independent Set and Maximum Matching R. Bar-Yehuda K. Censor-Hillel M. Ghaffari Gregory Schwartzman 54 51 0 01 Aug 2017