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. 2002.10047
  4. Cited By
Parallel Clique Counting and Peeling Algorithms

Parallel Clique Counting and Peeling Algorithms

24 February 2020
Jessica Shi
Laxman Dhulipala
Julian Shun
ArXivPDFHTML

Papers citing "Parallel Clique Counting and Peeling Algorithms"

13 / 13 papers shown
Title
Parallel Algorithms for Hierarchical Nucleus Decomposition
Parallel Algorithms for Hierarchical Nucleus Decomposition
Jessica Shi
Laxman Dhulipala
Julian Shun
18
0
0
14 Jun 2023
A Survey on the Densest Subgraph Problem and Its Variants
A Survey on the Densest Subgraph Problem and Its Variants
Tommaso Lanciano
Atsushi Miyauchi
Adriano Fazzone
Francesco Bonchi
24
39
0
25 Mar 2023
Parallelizing Maximal Clique Enumeration on GPUs
Parallelizing Maximal Clique Enumeration on GPUs
M. Almasri
Y. Chang
I. E. Hajj
R. Nagi
Jinjun Xiong
Wen-mei W. Hwu
18
9
0
02 Dec 2022
Hierarchical Agglomerative Graph Clustering in Poly-Logarithmic Depth
Hierarchical Agglomerative Graph Clustering in Poly-Logarithmic Depth
Laxman Dhulipala
David Eisenstat
Jakub Lacki
Vahab Mirronki
Jessica Shi
16
13
0
23 Jun 2022
Accelerating Clique Counting in Sparse Real-World Graphs via
  Communication-Reducing Optimizations
Accelerating Clique Counting in Sparse Real-World Graphs via Communication-Reducing Optimizations
Amogh Lonkar
S. Beamer
16
2
0
21 Dec 2021
Efficient and Scalable Graph Pattern Mining on GPUs
Efficient and Scalable Graph Pattern Mining on GPUs
Xuhao Chen
Arvind Mit Csail
GNN
21
30
0
17 Dec 2021
Theoretically and Practically Efficient Parallel Nucleus Decomposition
Theoretically and Practically Efficient Parallel Nucleus Decomposition
Jessica Shi
Laxman Dhulipala
Julian Shun
GNN
16
8
0
22 Nov 2021
Parallel Algorithms for Finding Large Cliques in Sparse Graphs
Parallel Algorithms for Finding Large Cliques in Sparse Graphs
Lukas Gianinazzi
Maciej Besta
Yannick Schaffner
Torsten Hoefler
64
21
0
20 Sep 2021
Parallel K-Clique Counting on GPUs
Parallel K-Clique Counting on GPUs
M. Almasri
I. E. Hajj
R. Nagi
Jinjun Xiong
Wen-mei W. Hwu
23
19
0
27 Apr 2021
GraphMineSuite: Enabling High-Performance and Programmable Graph Mining
  Algorithms with Set Algebra
GraphMineSuite: Enabling High-Performance and Programmable Graph Mining Algorithms with Set Algebra
Maciej Besta
Zur Vonarburg-Shmaria
Yannick Schaffner
Leonardo Schwarz
Grzegorz Kwa'sniewski
...
Philipp Lindenberger
Pavel Kalvoda
Marek Konieczny
O. Mutlu
Torsten Hoefler
30
27
0
05 Mar 2021
On the Locality of Nash-Williams Forest Decomposition and Star-Forest
  Decomposition
On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition
David G. Harris
Hsin-Hao Su
H. Vu
19
9
0
22 Sep 2020
Parallel Batch-Dynamic $k$-Clique Counting
Parallel Batch-Dynamic kkk-Clique Counting
Laxman Dhulipala
Quanquan C. Liu
Julian Shun
Shangdi Yu
36
25
0
30 Mar 2020
Massively Parallel Algorithms for Small Subgraph Counting
Massively Parallel Algorithms for Small Subgraph Counting
Amartya Shankha Biswas
T. Eden
Quanquan C. Liu
Slobodan Mitrović
R. Rubinfeld
27
8
0
19 Feb 2020
1