Triangle Counting in Large Historical Graphs
Konstantinos Christopoulos, Evaggelos Daskalakis, Agorakis Bompotas, Kostas Tsichlas · 2025
Counting local topological structures, such as triangles, is crucial to analyse large-scale networks and to understand the evolution of graphs. Triangles are fundamental for computing transitivity and for applications such as community detection and link prediction. Despite the importance of triangle counting, traditional algorithms struggle with scalability in networks with millions or billions of vertices, prompting the development of approximation methods and distributed solutions.