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
- 2. Yixiang Fang
- 3. Wensheng Luo
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,232 | Efficient Temporal Subgraph Management: A New Interval Index | 2026 | VLDB | 4.1945683e-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 |
|---|---|---|---|---|
| 283 | Querying K-Truss Community in Large and Dynamic Graphs | 2014 | SIGMOD | 0.00029041257 |
| 392 | Counting Triangles in Data Streams | 2006 | PODS | 0.00024556183 |
| 536 | The LDBC Social Network Benchmark: Interactive Workload | 2015 | SIGMOD | 0.00020722862 |
| 1,285 | Neighborhood Based Fast Graph Search in Large Networks | 2011 | SIGMOD | 0.00012833377 |
| 2,909 | Efficient Algorithms for Densest Subgraph Discovery | 2019 | VLDB | 7.9305767e-05 |
| 3,063 | Sliding Window-based Approximate Triangle Counting over Streaming Graphs with Duplicate Edges | 2021 | SIGMOD | 7.6321424e-05 |
| 4,481 | Efficient Temporal Butterfly Counting and Enumeration on Temporal Bipartite Graphs | 2024 | VLDB | 6.1485442e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 6,657 | On Querying Historical Connectivity in Temporal Graphs | 2024 | SIGMOD | 4.9720132e-05 |
| 10,871 | Efficient Computation of Hyper-triangles on Hypergraphs | 2025 | VLDB | 4.1945683e-05 |
| 1,344 | Counting and Sampling Triangles from a Graph Stream | 2013 | VLDB | 0.00012473724 |
| 11,042 | Efficient Index for Temporal Core Queries over Bipartite Graphs | 2024 | VLDB | 4.1945683e-05 |
| 4,879 | Approximately Counting Triangles in Large Graph Streams Including Edge Duplicates with a Fixed Memory Usage | 2018 | VLDB | 5.8575676e-05 |
| 4,970 | On Querying Connected Components in Large Temporal Graphs | 2023 | SIGMOD | 5.7945079e-05 |
| 5,046 | Better Algorithms for Counting Triangles in Data Streams | 2016 | PODS | 5.7405307e-05 |
| 3,063 | Sliding Window-based Approximate Triangle Counting over Streaming Graphs with Duplicate Edges | 2021 | SIGMOD | 7.6321424e-05 |
| 392 | Counting Triangles in Data Streams | 2006 | PODS | 0.00024556183 |
| 4,459 | Efficient Bi-triangle Counting for Large Bipartite Networks | 2021 | VLDB | 6.1651553e-05 |