Citations (45)
Keep up to date with the latest research on this topic with citation updates for this article.
Articles from other publishers (45)
Ying Chen, Siwei Qiang, Mingming Ha, Xiaolei Liu, Shaoshuai Li, Jiabi Tong, Lingfeng Yuan, Xiaobo Guo & Zhenfeng Zhu. (2023) Semi-Supervised Heterogeneous Graph Learning with Multi-Level Data Augmentation. ACM Transactions on Knowledge Discovery from Data 18:2, pages 1-27.
Crossref
Crossref
Abir Farouzi, Xiantian Zhou, Ladjel Bellatreche, Mimoun Malki & Carlos Ordonez. (2023) Balanced parallel triangle enumeration with an adaptive algorithm. Distributed and Parallel Databases.
Crossref
Crossref
Kai Wang, Xuemin Lin, Lu Qin, Wenjie Zhang & Ying Zhang. (2022) Accelerated butterfly counting with vertex priority on bipartite graphs. The VLDB Journal 32:2, pages 257-281.
Crossref
Crossref
Yuan Zhe, Wei Zhewei & Wen Ji-rong. (2023) Index-adaptive Triangle-Based Graph Local Clustering. Computers, Materials & Continua 75:3, pages 5009-5026.
Crossref
Crossref
Adrian Dumitrescu & Andrzej Lingas. 2023. Combinatorial Algorithms. Combinatorial Algorithms
185
196
.
Thibaud Trolliet, Nathann Cohen, Frédéric Giroire, Luc Hogie & Stéphane Pérennes. (2022) Interest clustering coefficient: a new metric for directed networks like Twitter. Journal of Complex Networks 10:1.
Crossref
Crossref
Amir Abboud, Keren Censor-Hillel, Seri Khoury & Christoph Lenzen. (2020) Fooling views: a new lower bound technique for distributed computations under congestion. Distributed Computing 33:6, pages 545-559.
Crossref
Crossref
Ahmet Kara, Hung Q. Ngo, Milos Nikolic, Dan Olteanu & Haozhe Zhang. (2020) Maintaining Triangle Queries under Updates. ACM Transactions on Database Systems 45:3, pages 1-46.
Crossref
Crossref
Ning Liu, Dong-sheng Li, Yi-ming Zhang & Xiong-lve Li. (2020) Large-scale graph processing systems: a survey. Frontiers of Information Technology & Electronic Engineering 21:3, pages 384-404.
Crossref
Crossref
Talya Eden, Dana Ron & C. Seshadhri. (2020) On Approximating the Number of $k$-Cliques in Sublinear Time. SIAM Journal on Computing 49:4, pages 747-771.
Crossref
Crossref
Emilio Coppa, Irene Finocchi & Renan Leon Garcia. (2019) Counting cliques in parallel without a cluster: Engineering a fork/join algorithm for shared-memory platforms. Information Sciences 496, pages 553-571.
Crossref
Crossref
Matthias Bentert, Till Fluschnik, André Nichterlein & Rolf Niedermeier. (2019) Parameterized aspects of triangle enumeration. Journal of Computer and System Sciences 103, pages 61-77.
Crossref
Crossref
Kai Wang, Xuemin Lin, Lu Qin, Wenjie Zhang & Ying Zhang. (2019) Vertex priority based butterfly counting for large-scale bipartite networks. Proceedings of the VLDB Endowment 12:10, pages 1139-1152.
Crossref
Crossref
Guyue Han & Harish Sethu. 2019. From Security to Community Detection in Social Networking Platforms. From Security to Community Detection in Social Networking Platforms
133
157
.
Haoduo Yang, Huayou Su, Qiang Lan, Mei Wen & Chunyuan Zhang. (2018) HPGraph: High-Performance Graph Analytics with Productivity on the GPU. Scientific Programming 2018, pages 1-11.
Crossref
Crossref
Peipei Zhou, Zhenyuan Ruan, Zhenman Fang, Megan Shand, David Roazen & Jason Cong. (2018) Doppio: I/O-Aware Performance Analysis, Modeling and Optimization for In-memory Computing Framework. Doppio: I/O-Aware Performance Analysis, Modeling and Optimization for In-memory Computing Framework.
Maryam Aliakbarpour, Amartya Shankha Biswas, Themis Gouleakis, John Peebles, Ronitt Rubinfeld & Anak Yodpinyanee. (2017) Sublinear-Time Algorithms for Counting Star Subgraphs via Edge Sampling. Algorithmica 80:2, pages 668-697.
Crossref
Crossref
Ahmad Askarian, Rupei Xu & Andras Farago. 2018. Graph Theoretic Approaches for Analyzing Large-Scale Social Networks. Graph Theoretic Approaches for Analyzing Large-Scale Social Networks
146
163
.
Lorenzo De Stefani, Alessandro Epasto, Matteo Riondato & Eli Upfal. (2017) TRIÈST. ACM Transactions on Knowledge Discovery from Data 11:4, pages 1-50.
Crossref
Crossref
Min Li, Jian Tan, Yandong Wang, Li Zhang & Valentina Salapura. (2017) SparkBench: a spark benchmarking suite characterizing large-scale in-memory data analytics. Cluster Computing 20:3, pages 2575-2589.
Crossref
Crossref
Julian Shun. 2017. Shared-Memory Parallelism Can Be Simple, Fast, and Scalable. Shared-Memory Parallelism Can Be Simple, Fast, and Scalable.
Zhan Shi, Junhao Li, Pengfei Guo, Shuangshuang Li, Dan Feng & Yi Su. (2017) Partitioning dynamic graph asynchronously with distributed FENNEL. Future Generation Computer Systems 71, pages 32-42.
Crossref
Crossref
Talya Eden, Amit Levi, Dana Ron & C. Seshadhri. (2017) Approximately Counting Triangles in Sublinear Time. SIAM Journal on Computing 46:5, pages 1603-1646.
Crossref
Crossref
Hao Zhang, Yuanyuan Zhu, Lu Qin, Hong Cheng & Jeffrey Xu Yu. 2017. Database Systems for Advanced Applications. Database Systems for Advanced Applications
371
386
.
Mostafa Haghir Chehreghani. (2016) A Framework for Description and Analysis of Sampling-Based Approximate Triangle Counting Algorithms. A Framework for Description and Analysis of Sampling-Based Approximate Triangle Counting Algorithms.
Bin Wu, Ke Yi & Zhenguo Li. (2016) Counting Triangles in Large Graphs by Random Sampling. IEEE Transactions on Knowledge and Data Engineering 28:8, pages 2013-2026.
Crossref
Crossref
Abdul Quamar, Amol Deshpande & Jimmy Lin. (2015) NScale: neighborhood-centric large-scale graph analytics in the cloud. The VLDB Journal 25:2, pages 125-150.
Crossref
Crossref
Abdul Quamar & Amol Deshpande. (2016) NScaleSpark. NScaleSpark.
Lorenzo De Stefani, Alessandro Epasto, Matteo Riondato & Eli Upfal. (2016) TRIÈST. TRIÈST.
Andrew McGregor, Sofya Vorotnikova & Hoa T. Vu. (2016) Better Algorithms for Counting Triangles in Data Streams. Better Algorithms for Counting Triangles in Data Streams.
Kitty Meeks. (2016) The challenges of unbounded treewidth in parameterised subgraph counting problems. Discrete Applied Mathematics 198, pages 170-194.
Crossref
Crossref
Irene Finocchi, Marco Finocchi & Emanuele G. Fusco. (2015) Clique Counting in MapReduce. ACM Journal of Experimental Algorithmics 20, pages 1-20.
Crossref
Crossref
Talya Eden, Amit Levi, Dana Ron & C. Seshadhri. (2015) Approximately Counting Triangles in Sublinear Time. Approximately Counting Triangles in Sublinear Time.
Julian Shun & Kanat Tangwongsan. (2015) Multicore triangle computations without tuning. Multicore triangle computations without tuning.
Min Li, Jian Tan, Yandong Wang, Li Zhang & Valentina Salapura. (2015) SparkBench. SparkBench.
Charalampos Tsourakakis. (2015) The K-clique Densest Subgraph Problem. The K-clique Densest Subgraph Problem.
Kai Liu, William K. Cheung & Jiming Liu. (2013) Detecting multiple stochastic network motifs in network data. Knowledge and Information Systems 42:1, pages 49-74.
Crossref
Crossref
Xiaocheng Hu, Yufei Tao & Chin-Wan Chung. (2014) I/O-Efficient Algorithms on Triangle Listing and Counting. ACM Transactions on Database Systems 39:4, pages 1-30.
Crossref
Crossref
Mahmudur Rahman, Mansurul Alam Bhuiyan & Mohammad Al Hasan. (2014) Graft: An Efficient Graphlet Counting Method for Large Graph Analysis. IEEE Transactions on Knowledge and Data Engineering 26:10, pages 2466-2478.
Crossref
Crossref
Radu Curticapean & Daniel Marx. (2014) Complexity of Counting Subgraphs: Only the Boundedness of the Vertex-Cover Number Counts. Complexity of Counting Subgraphs: Only the Boundedness of the Vertex-Cover Number Counts.
Mahmudur Rahman & Mohammad Al Hasan. (2014) Sampling Triples from Restricted Networks using MCMC Strategy. Sampling Triples from Restricted Networks using MCMC Strategy.
Tamara G. Kolda, Ali Pinar, Todd Plantenga, C. Seshadhri & Christine Task. (2014) Counting Triangles in Massive Graphs with MapReduce. SIAM Journal on Scientific Computing 36:5, pages S48-S77.
Crossref
Crossref
Andreas Björklund, Rasmus Pagh, Virginia Vassilevska Williams & Uri Zwick. 2014. Automata, Languages, and Programming. Automata, Languages, and Programming
223
234
.
Konstantin Kutzkov & Rasmus Pagh. 2014. Algorithm Theory – SWAT 2014. Algorithm Theory – SWAT 2014
306
318
.
Vladimir Braverman, Rafail Ostrovsky & Dan Vilenchik. 2013. Automata, Languages, and Programming. Automata, Languages, and Programming
244
254
.