Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
triangle enumeration
Description:
Triangle enumeration is the computational task of finding or listing all three-vertex cycles in a graph.
Primary topic:
Graph Theory and Algorithms (42%)
Related topics:
Graph Theory and Algorithms (42%),
Complexity and Algorithms in Graphs (17%),
Limits and Structures in Graph Theory (15%)
OpenAlex ID:
keywords/triangle-enumeration
Main-memory triangle computations for very large (sparse (power-law)) graphs
2008
·
Matthieu Latapy
·
Theoretical Computer Science
·
545
PDF
Efficient semi-streaming algorithms for local triangle counting in massive graphs
2008
·
Luca Becchetti
, Paolo Boldi
, et al.
·
ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD)
·
375
Towards polynomial lower bounds for dynamic problems
2010
·
Mihai Patrascu
·
ACM Symposium on Theory of Computing (STOC)
·
362
Higher Lower Bounds from the 3SUM Conjecture
2015
·
Tsvi Kopelowitz
, Seth Pettie
, et al.
·
ACM-SIAM Symposium on Discrete Algorithms (SODA)
·
200
PDF
Multicore triangle computations without tuning
2015
·
Julian Shun
, Kanat Tangwongsan
·
IEEE International Conference on Data Engineering (ICDE)
·
191
Parallel Triangle Counting and Enumeration Using Matrix Algebra
2015
·
Ariful Azad
, Aydin Buluc
, et al.
·
IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum
·
180
Triadic Measures on Graphs: The Power of Wedge Sampling
2013
·
C. Seshadhri
, Ali Pinar
, et al.
·
SIAM International Conference on Data Mining
·
169
PDF
Enumerating subgraph instances using map-reduce
2013
·
F. N. Afrati
, D. Fotakis
, et al.
·
IEEE International Conference on Data Engineering (ICDE)
·
145
On triangulation-based dense neighborhood graph discovery
2010
·
Nan Wang
, Jingbo Zhang
, et al.
·
Proceedings of the VLDB Endowment
·
132
Finding, minimizing, and counting weighted subgraphs
2009
·
Virginia Vassilevska
, Ryan Williams
·
ACM Symposium on Theory of Computing (STOC)
·
118
MapReduce Triangle Enumeration With Guarantees
2014
·
Ha-Myung Park
, Francesco Silvestri
, et al.
·
ACM International Conference on Information and Knowledge Management (CIKM)
·
105
Triangle Listing Algorithms: Back from the Diversion
2013
·
Mark Ortmann
, Ulrik Brandes
·
Society for Industrial and Applied Mathematics eBooks
·
100
PDF
Matching Triangles and Basing Hardness on an Extremely Popular Conjecture
2015
·
Amir Abboud
, Virginia Vassilevska Williams
, et al.
·
ACM Symposium on Theory of Computing (STOC)
·
86
The input/output complexity of triangle enumeration
2014
·
Rasmus Pagh
, Francesco Silvestri
·
ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS)
·
86
PDF
Lower bounds on the number of triangles in a graph
1989
·
David C. Fisher
·
Journal of Graph Theory
·
79
Improved Distributed Expander Decomposition and Nearly Optimal Triangle Enumeration
2019
·
Yi-Jun Chang
, Thatchaphol Saranurak
·
ACM Symposium on Principles of Distributed Computing (PODC)
·
73
PDF
OPT: a new framework for overlapped and parallel triangulation in large-scale graphs
2014
·
Jinha Kim
, Wook-Shin Han
, et al.
·
ACM SIGMOD International Conference on Management of Data (SIGMOD)
·
72
PTE: Enumerating Trillion Triangles On Distributed Systems
2016
·
Ha-Myung Park
, Sung-Hyon Myaeng
, et al.
·
ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD)
·
69
The Maximum Number of Triangles in C2k+1-Free Graphs
2012
·
ERVIN GYŐRI
, HAO LI
·
Combinatorics Probability Computing
·
64
Deterministic Distributed Expander Decomposition and Routing with Applications in Distributed Derandomization
2020
·
Yi-Jun Chang
, Thatchaphol Saranurak
·
Annual Symposium on Foundations of Computer Science
·
63
PDF
Distributed Triangle Detection via Expander Decomposition
2019
·
Yi-Jun Chang
, Seth Pettie
, et al.
·
Society for Industrial and Applied Mathematics eBooks
·
58
Truss decomposition on shared-memory parallel systems
2017
·
Shaden Smith
, Xing Liu
, et al.
·
IEEE High Performance Extreme Computing Conference
·
56
Accelerating truss decomposition on heterogeneous processors
2020
·
Yulin Che
, Zhuohang Lai
, et al.
·
Proceedings of the VLDB Endowment
·
55
Why do simple algorithms for triangle enumeration work in the real world?
2014
·
Jonathan W. Berry
, Luke K. Fostvedt
, et al.
·
Conference on Innovations in Theoretical Computer Science
·
55
On the Distributed Complexity of Large-Scale Graph Computations
2018
·
Gopal Pandurangan
, Peter Robinson
, et al.
·
ACM Transactions on Parallel Computing
·
53
PDF
Show more works
View as search
Works count:
176
Citation count:
4,427
Year
Topic
Type