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. 1904.08037
  4. Cited By
Improved Distributed Expander Decomposition and Nearly Optimal Triangle
  Enumeration

Improved Distributed Expander Decomposition and Nearly Optimal Triangle Enumeration

17 April 2019
Yi-Jun Chang
Thatchaphol Saranurak
ArXivPDFHTML

Papers citing "Improved Distributed Expander Decomposition and Nearly Optimal Triangle Enumeration"

11 / 11 papers shown
Title
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
Distributed Triangle Detection via Expander Decomposition
Distributed Triangle Detection via Expander Decomposition
Yi-Jun Chang
Seth Pettie
Hengjie Zhang
30
46
0
17 Jul 2018
New Distributed Algorithms in Almost Mixing Time via Transformations
  from Parallel Algorithms
New Distributed Algorithms in Almost Mixing Time via Transformations from Parallel Algorithms
M. Ghaffari
Jason Li
38
44
0
12 May 2018
Sparse Matrix Multiplication and Triangle Listing in the Congested
  Clique Model
Sparse Matrix Multiplication and Triangle Listing in the Congested Clique Model
K. Censor-Hillel
Dean Leitersdorf
Elia Turner
25
34
0
13 Feb 2018
Fooling Views: A New Lower Bound Technique for Distributed Computations
  under Congestion
Fooling Views: A New Lower Bound Technique for Distributed Computations under Congestion
Amir Abboud
K. Censor-Hillel
Seri Khoury
Christoph Lenzen
45
29
0
05 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
Triangle Finding and Listing in CONGEST Networks
Triangle Finding and Listing in CONGEST Networks
Taisuke Izumi
F. Gall
46
55
0
25 May 2017
On the Distributed Complexity of Large-Scale Graph Computations
On the Distributed Complexity of Large-Scale Graph Computations
Gopal Pandurangan
Peter Robinson
Michele Scquizzato
50
53
0
26 Feb 2016
Algebraic Methods in the Congested Clique
Algebraic Methods in the Congested Clique
K. Censor-Hillel
P. Kaski
Janne H. Korhonen
Christoph Lenzen
A. Paz
Jukka Suomela
33
160
0
17 Mar 2015
Flow-Based Algorithms for Local Graph Clustering
Flow-Based Algorithms for Local Graph Clustering
L. Orecchia
Zeyuan Allen-Zhu
57
94
0
10 Jul 2013
"Tri, Tri again": Finding Triangles and Small Subgraphs in a Distributed
  Setting
"Tri, Tri again": Finding Triangles and Small Subgraphs in a Distributed Setting
Danny Dolev
Christoph Lenzen
Shir Peled
63
111
0
31 Jan 2012
1