$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

17 May 2022

Papers citing "Narrowing the LOCAL$\unicode{x2013}$CONGEST Gaps in Sparse Networks via Expander Decompositions"

8 / 8 papers shown

Title
The Distributed Complexity of Locally Checkable Labeling Problems Beyond Paths and Trees Yi-Jun Chang 54 1 0 12 Nov 2023
A Nearly Linear-Time Distributed Algorithm for Exact Maximum Matching Taisuke Izumi Naoki Kitamura Yutaro Yamaguchi 22 0 0 07 Nov 2023
The Complexity of Distributed Approximation of Packing and Covering Integer Linear Programs Yi-Jun Chang Zeyong Li 29 4 0 02 May 2023
Efficient Distributed Decomposition and Routing Algorithms in Minor-Free Networks and Their Applications Yi-Jun Chang 20 5 0 10 Apr 2023
$(1-ε)$ -Approximate Maximum Weighted Matching in Distributed, Parallel, and Semi-Streaming Settings Shang-En Huang Hsin-Hao Su 22 2 0 29 Dec 2022
Lower Bounds for Induced Cycle Detection in Distributed Computing Franccois Le Gall Masayuki Miyamoto 24 6 0 02 Oct 2021
Local certification of graph decompositions and applications to minor-free classes Nicolas Bousquet Laurent Feuilloley Théo Pierron 13 22 0 30 Jul 2021
Bibliography of distributed approximation beyond bounded degree Laurent Feuilloley 27 3 0 22 Jan 2020