DOULION
DOULION: counting triangles in massive graphs with a coin. Counting the number of triangles in a graph is a beautiful algorithmic problem which has gained importance over the last years due to its significant role in complex network analysis. Metrics frequently computed such as the clustering coefficient and the transitivity ratio involve the execution of a triangle counting algorithm. Furthermore, several interesting graph mining applications rely on computing the number of triangles in the graph of interest. In this paper, we focus on the problem of counting triangles in a graph. We propose a practical method, out of which all triangle counting algorithms can potentially benefit. Using a straightforward triangle counting algorithm as a black box, we performed 166 experiments on real-world networks and on synthetic datasets as well, where we show that our method works with high accuracy, typically more than 99% and gives significant speedups, resulting in even ≈ 130 times faster performance.
Keywords for this software
References in zbMATH (referenced in 12 articles )
Showing results 1 to 12 of 12.
Sorted by year (- Eden, Talya; Ron, Dana; Seshadhri, C.: On approximating the number of (k)-cliques in sublinear time (2020)
- Jung, Minsoo; Lim, Yongsub; Lee, Sunmin; Kang, U.: FURL: fixed-memory and uncertainty reducing local triangle counting for multigraph streams (2019)
- Kaski, Petteri: Engineering a delegatable and error-tolerant algorithm for counting small subgraphs (2018)
- Cormode, Graham; Jowhari, Hossein: A second look at counting triangles in graph streams (corrected) (2017)
- Eden, Talya; Levi, Amit; Ron, Dana; Seshadhri, C.: Approximately counting triangles in sublinear time (2017)
- Bulteau, Laurent; Froese, Vincent; Kutzkov, Konstantin; Pagh, Rasmus: Triangle counting in dynamic graph streams (2016)
- Lagraa, Sofiane; Seba, Hamida: An efficient exact algorithm for triangle listing in large graphs (2016)
- Lattanzi, Silvio; Leonardi, Stefano: Efficient computation of the weighted clustering coefficient (2016)
- Cormode, Graham; Jowhari, Hossein: A second look at counting triangles in graph streams (2014)
- Pagh, Rasmus; Tsourakakis, Charalampos E.: Colorful triangle counting and a \textscMapReduceimplementation (2012)
- Schudy, Warren; Sviridenko, Maxim: Concentration and moment inequalities for polynomials of independent random variables (2012)
- Tsourakakis, Charalampos E.; Kolountzakis, Mihail N.; Miller, Gary L.: Triangle sparsifiers (2011)