Efficiently Counting Triangles in Large Temporal Graphs
Summary: Efficient delta-temporal triangle counting in large temporal graphs via online edge-enumeration and a compact 2D-point index built with hierarchical structures. Also tackles binary delta-temporal triangles; experiments show up to 70x speedups over state-of-the-art and 108x over the online baseline. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Yuyang Xia (Chinese University of Hong Kong)
- 2. Yixiang Fang (Chinese University of Hong Kong)
- 3. Wensheng Luo (Chinese University of Hong Kong)
BibTeX Citation
@inproceedings{xia_sigmod25,
title = {{Efficiently Counting Triangles in Large Temporal Graphs}},
author = {Xia, Yuyang and Fang, Yixiang and Luo, Wensheng},
series = {{SIGMOD} '25},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3709688},
url = {https://dl.acm.org/doi/10.1145/3709688},
year = {2025}
}Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,520 | Efficient Temporal Subgraph Management: A New Interval Index | 2026 | VLDB | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 7 of 7 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 189 | Querying K-Truss Community in Large and Dynamic Graphs | 2014 | SIGMOD | 0.00026114928 |
| 426 | The LDBC Social Network Benchmark: Interactive Workload | 2015 | SIGMOD | 0.00018692185 |
| 458 | Counting Triangles in Data Streams | 2006 | PODS | 0.0001810876 |
| 1,394 | Neighborhood Based Fast Graph Search in Large Networks | 2011 | SIGMOD | 0.0001093153 |
| 2,024 | Efficient Algorithms for Densest Subgraph Discovery | 2019 | VLDB | 9.2907829e-05 |
| 2,635 | Sliding Window-based Approximate Triangle Counting over Streaming Graphs with Duplicate Edges | 2021 | SIGMOD | 8.3200595e-05 |
| 3,911 | Efficient Temporal Butterfly Counting and Enumeration on Temporal Bipartite Graphs | 2024 | VLDB | 7.0240227e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 10,283 | Querying Cohesive Subgraphs in Temporal Graphs | 2026 | SIGMOD |
| 2 | 11,094 | Efficient Computation of Hyper-triangles on Hypergraphs | 2025 | VLDB |
| 3 | 1,103 | Counting and Sampling Triangles from a Graph Stream | 2013 | VLDB |
| 4 | 8,149 | Efficient Index for Temporal Core Queries over Bipartite Graphs | 2024 | VLDB |
| 5 | 4,500 | Approximately Counting Triangles in Large Graph Streams Including Edge Duplicates with a Fixed Memory Usage | 2018 | VLDB |
| 6 | 3,836 | On Querying Connected Components in Large Temporal Graphs | 2023 | SIGMOD |
| 7 | 5,110 | Better Algorithms for Counting Triangles in Data Streams | 2016 | PODS |
| 8 | 2,635 | Sliding Window-based Approximate Triangle Counting over Streaming Graphs with Duplicate Edges | 2021 | SIGMOD |
| 9 | 458 | Counting Triangles in Data Streams | 2006 | PODS |
| 10 | 3,997 | Efficient Bi-triangle Counting for Large Bipartite Networks | 2021 | VLDB |