ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1909.00844
  4. Cited By
Faster Algorithms for Edge Connectivity via Random $2$-Out Contractions

Faster Algorithms for Edge Connectivity via Random 222-Out Contractions

2 September 2019
M. Ghaffari
Krzysztof Nowicki
M. Thorup
ArXivPDFHTML

Papers citing "Faster Algorithms for Edge Connectivity via Random $2$-Out Contractions"

18 / 18 papers shown
Title
Random $k$-out subgraph leaves only $O(n/k)$ inter-component edges
Random kkk-out subgraph leaves only O(n/k)O(n/k)O(n/k) inter-component edges
J. Holm
Valerie King
M. Thorup
Or Zamir
Uri Zwick
OT
15
10
0
24 Sep 2019
Distributed Edge Connectivity in Sublinear Time
Distributed Edge Connectivity in Sublinear Time
Mohit Daga
Monika Henzinger
Danupon Nanongkai
Thatchaphol Saranurak
47
40
0
08 Apr 2019
Exponentially Faster Massively Parallel Maximal Matching
Exponentially Faster Massively Parallel Maximal Matching
Soheil Behnezhad
Mohammadtaghi Hajiaghayi
David G. Harris
43
61
0
11 Jan 2019
Weighted Matchings via Unweighted Augmentations
Weighted Matchings via Unweighted Augmentations
Buddhima Gamlath
S. Kale
Slobodan Mitrovic
William Yang Wang
45
66
0
07 Nov 2018
Parallel Minimum Cuts in Near-linear Work and Low Depth
Parallel Minimum Cuts in Near-linear Work and Low Depth
Barbara Geissmann
Lukas Gianinazzi
28
22
0
25 Jul 2018
Random Sampling Applied to the MST Problem in the Node Congested Clique
  Model
Random Sampling Applied to the MST Problem in the Node Congested Clique Model
Krzysztof Nowicki
28
3
0
23 Jul 2018
Sparsifying Distributed Algorithms with Ramifications in Massively
  Parallel Computation and Centralized Local Computation
Sparsifying Distributed Algorithms with Ramifications in Massively Parallel Computation and Centralized Local Computation
M. Ghaffari
Jara Uitto
46
101
0
17 Jul 2018
Parallel Graph Connectivity in Log Diameter Rounds
Parallel Graph Connectivity in Log Diameter Rounds
Alexandr Andoni
C. Stein
Zhao Song
Zhengyu Wang
Peilin Zhong
38
99
0
08 May 2018
Massively Parallel Algorithms for Finding Well-Connected Components in
  Sparse Graphs
Massively Parallel Algorithms for Finding Well-Connected Components in Sparse Graphs
Sepehr Assadi
Xiaorui Sun
Omri Weinstein
38
58
0
08 May 2018
Approximating Edit Distance in Truly Subquadratic Time: Quantum and
  MapReduce
Approximating Edit Distance in Truly Subquadratic Time: Quantum and MapReduce
Mahdi Boroujeni
S. Ehsani
Mohammad Ghodsi
Mohammadtaghi Hajiaghayi
Saeed Seddighin
29
74
0
11 Apr 2018
Improved Massively Parallel Computation Algorithms for MIS, Matching,
  and Vertex Cover
Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover
M. Ghaffari
Themis Gouleakis
Christian Konrad
Slobodan Mitrovic
R. Rubinfeld
45
131
0
22 Feb 2018
Probabilistic Tools for the Analysis of Randomized Optimization
  Heuristics
Probabilistic Tools for the Analysis of Randomized Optimization Heuristics
Benjamin Doerr
35
173
0
20 Jan 2018
Coresets Meet EDCS: Algorithms for Matching and Vertex Cover on Massive
  Graphs
Coresets Meet EDCS: Algorithms for Matching and Vertex Cover on Massive Graphs
Sepehr Assadi
M. Bateni
A. Bernstein
Vahab Mirrokni
Cliff Stein
43
123
0
08 Nov 2017
MST in O(1) Rounds of the Congested Clique
MST in O(1) Rounds of the Congested Clique
T. Jurdzinski
Krzysztof Nowicki
LRM
49
92
0
26 Jul 2017
Round Compression for Parallel Matching Algorithms
Round Compression for Parallel Matching Algorithms
A. Czumaj
Jakub Lacki
Aleksander Madry
Slobodan Mitrovic
Krzysztof Onak
Piotr Sankowski
61
100
0
11 Jul 2017
Super-fast MST Algorithms in the Congested Clique using $o(m)$ Messages
Super-fast MST Algorithms in the Congested Clique using o(m)o(m)o(m) Messages
Sriram V. Pemmaraju
Vivek Sardeshmukh
LRM
37
14
0
12 Oct 2016
Almost-Tight Distributed Minimum Cut Algorithms
Almost-Tight Distributed Minimum Cut Algorithms
Danupon Nanongkai
Hsin-Hao Su
78
54
0
04 Aug 2014
Distributed Minimum Cut Approximation
Distributed Minimum Cut Approximation
M. Ghaffari
Fabian Kuhn
53
91
0
23 May 2013
1