Distributed Edge Connectivity in Sublinear Time

8 April 2019

Papers citing "Distributed Edge Connectivity in Sublinear Time"

8 / 8 papers shown

Title
A Nearly Time-Optimal Distributed Approximation of Minimum Cost $k$ -Edge-Connected Spanning Subgraph Michal Dory M. Ghaffari 17 2 0 09 Nov 2022
$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 29 10 0 17 May 2022
A Subquadratic-Time Distributed Algorithm for Exact Maximum Matching Naoki Kitamura Taisuke Izumi 19 5 0 25 Apr 2021
Strong-Diameter Network Decomposition Yi-Jun Chang M. Ghaffari 15 15 0 19 Feb 2021
Minor Sparsifiers and the Distributed Laplacian Paradigm S. Forster Gramoz Goranci Yang P. Liu Richard Peng Xiaorui Sun Mingquan Ye 20 20 0 31 Dec 2020
Distributed Weighted Min-Cut in Nearly-Optimal Time Michal Dory Yuval Efron Sagnik Mukhopadhyay Danupon Nanongkai 24 21 0 20 Apr 2020
Distributed Exact Weighted All-Pairs Shortest Paths in Near-Linear Time A. Bernstein K. Kirchberg 11 49 0 08 Nov 2018
Dense Subgraphs on Dynamic Networks Atish Das Sarma Ashwin Lall Danupon Nanongkai Amitabh Trehan 56 20 0 07 Aug 2012