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
v1v2 (latest)

Improved Distributed Expander Decomposition and Nearly Optimal Triangle Enumeration

17 April 2019
Yi-Jun Chang
Thatchaphol Saranurak
ArXiv (abs)PDFHTML

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

16 / 16 papers shown
Title
Even-Cycle Detection in the Randomized and Quantum CONGEST Model
Even-Cycle Detection in the Randomized and Quantum CONGEST Model
Pierre Fraigniaud
Mael Luce
F. Magniez
Ioan Todinca
73
8
0
19 Feb 2024
Distributed Subgraph Finding: Progress and Challenges
Distributed Subgraph Finding: Progress and Challenges
K. Censor-Hillel
56
14
0
13 Mar 2022
Quantum Distributed Algorithms for Detection of Cliques
Quantum Distributed Algorithms for Detection of Cliques
K. Censor-Hillel
Orr Fischer
Franccois Le Gall
Dean Leitersdorf
R. Oshman
GNN
40
26
0
09 Jan 2022
Beyond Distributed Subgraph Detection: Induced Subgraphs, Multicolored
  Problems and Graph Parameters
Beyond Distributed Subgraph Detection: Induced Subgraphs, Multicolored Problems and Graph Parameters
Janne H. Korhonen
Amir Nikabadi
GNN
82
5
0
14 Sep 2021
Strong-Diameter Network Decomposition
Strong-Diameter Network Decomposition
Yi-Jun Chang
M. Ghaffari
60
15
0
19 Feb 2021
Fast Distributed Algorithms for Girth, Cycles and Small Subgraphs
Fast Distributed Algorithms for Girth, Cycles and Small Subgraphs
K. Censor-Hillel
Orr Fischer
T. Gonen
F. Gall
Dean Leitersdorf
R. Oshman
137
28
0
19 Jan 2021
Minor Sparsifiers and the Distributed Laplacian Paradigm
Minor Sparsifiers and the Distributed Laplacian Paradigm
S. Forster
Gramoz Goranci
Yang P. Liu
Richard Peng
Xiaorui Sun
Mingquan Ye
53
22
0
31 Dec 2020
Tight Distributed Listing of Cliques
Tight Distributed Listing of Cliques
K. Censor-Hillel
Yi-Jun Chang
Franccois Le Gall
Dean Leitersdorf
63
21
0
14 Nov 2020
Finding Subgraphs in Highly Dynamic Networks
Finding Subgraphs in Highly Dynamic Networks
K. Censor-Hillel
V. I. Kolobov
Gregory Schwartzman
21
5
0
17 Sep 2020
Deterministic Distributed Expander Decomposition and Routing with
  Applications in Distributed Derandomization
Deterministic Distributed Expander Decomposition and Routing with Applications in Distributed Derandomization
Yi-Jun Chang
Thatchaphol Saranurak
33
34
0
29 Jul 2020
On Distributed Listing of Cliques
On Distributed Listing of Cliques
K. Censor-Hillel
F. Gall
Dean Leitersdorf
41
24
0
10 Jul 2020
Distributed Dense Subgraph Detection and Low Outdegree Orientation
Distributed Dense Subgraph Detection and Low Outdegree Orientation
Hsin-Hao Su
H. Vu
77
23
0
29 Jul 2019
Quantum Distributed Algorithm for the All-Pairs Shortest Path Problem in
  the CONGEST-CLIQUE Model
Quantum Distributed Algorithm for the All-Pairs Shortest Path Problem in the CONGEST-CLIQUE Model
Taisuke Izumi
F. Gall
33
35
0
06 Jun 2019
Distributed Edge Connectivity in Sublinear Time
Distributed Edge Connectivity in Sublinear Time
Mohit Daga
Monika Henzinger
Danupon Nanongkai
Thatchaphol Saranurak
55
40
0
08 Apr 2019
Detecting cliques in CONGEST networks
Detecting cliques in CONGEST networks
A. Czumaj
C. Konrad
50
36
0
03 Jul 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
73
29
0
05 Nov 2017
1