On power-law relationships of the Internet topology
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Counting triangles in data streams
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Efficient semi-streaming algorithms for local triangle counting in massive graphs
Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
Main-memory triangle computations for very large (sparse (power-law)) graphs
Theoretical Computer Science
Efficient approximation algorithms for shortest cycles in undirected graphs
Information Processing Letters
Finding, minimizing, and counting weighted subgraphs
Proceedings of the forty-first annual ACM symposium on Theory of computing
Efficient measurement of complex networks using link queries
INFOCOM'09 Proceedings of the 28th IEEE international conference on Computer Communications Workshops
Estimating clustering indexes in data streams
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Efficient approximation algorithms for shortest cycles in undirected graphs
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Efficient algorithms for large-scale local triangle counting
ACM Transactions on Knowledge Discovery from Data (TKDD)
From a stream of relational queries to distributed stream processing
Proceedings of the VLDB Endowment
On triangulation-based dense neighborhood graph discovery
Proceedings of the VLDB Endowment
SpamWatcher: a streaming social network analytic on the IBM wire-speed processor
Proceedings of the 5th ACM international conference on Distributed event-based system
Triangle listing in massive networks and its applications
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
Triangle listing in massive networks
ACM Transactions on Knowledge Discovery from Data (TKDD) - Special Issue on the Best of SIGKDD 2011
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
A space efficient streaming algorithm for triangle counting using the birthday paradox
Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
Towards a bipartite graph modeling of the internet topology
Computer Networks: The International Journal of Computer and Telecommunications Networking
PATRIC: a parallel algorithm for counting triangles in massive networks
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
An efficient MapReduce algorithm for counting triangles in a very large graph
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Parallel triangle counting in massive streaming graphs
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Top-K structural diversity search in large networks
Proceedings of the VLDB Endowment
Why do simple algorithms for triangle enumeration work in the real world?
Proceedings of the 5th conference on Innovations in theoretical computer science
Counting and sampling triangles from a graph stream
Proceedings of the VLDB Endowment
Load balanced clustering coefficients
Proceedings of the first workshop on Parallel programming for analytics applications
| Hi-index | 0.00 |
In the past, the fundamental graph problem of triangle counting and listing has been studied intensively from a theoretical point of view. Recently, triangle counting has also become a widely used tool in network analysis. Due to the very large size of networks like the Internet, WWW or social networks, the efficiency of algorithms for triangle counting and listing is an important issue. The main intention of this work is to evaluate the practicability of triangle counting and listing in very large graphs with various degree distributions. We give a surprisingly simple enhancement of a well known algorithm that performs best, and makes triangle listing and counting in huge networks feasible. This paper is a condensed presentation of [SW05].