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.1905499e-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 |
|---|---|---|---|---|
| 284 | Querying K-Truss Community in Large and Dynamic Graphs | 2014 | SIGMOD | 0.00029014359 |
| 389 | Counting Triangles in Data Streams | 2006 | PODS | 0.00024649634 |
| 530 | The LDBC Social Network Benchmark: Interactive Workload | 2015 | SIGMOD | 0.00020823189 |
| 1,280 | Neighborhood Based Fast Graph Search in Large Networks | 2011 | SIGMOD | 0.00012838714 |
| 2,913 | Efficient Algorithms for Densest Subgraph Discovery | 2019 | VLDB | 7.9229304e-05 |
| 3,067 | Sliding Window-based Approximate Triangle Counting over Streaming Graphs with Duplicate Edges | 2021 | SIGMOD | 7.6247945e-05 |
| 4,484 | Efficient Temporal Butterfly Counting and Enumeration on Temporal Bipartite Graphs | 2024 | VLDB | 6.1426351e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 6,660 | On Querying Historical Connectivity in Temporal Graphs | 2024 | SIGMOD | 4.9672425e-05 |
| 10,875 | Efficient Computation of Hyper-triangles on Hypergraphs | 2025 | VLDB | 4.1905499e-05 |
| 1,348 | Counting and Sampling Triangles from a Graph Stream | 2013 | VLDB | 0.00012461666 |
| 11,045 | Efficient Index for Temporal Core Queries over Bipartite Graphs | 2024 | VLDB | 4.1905499e-05 |
| 4,883 | Approximately Counting Triangles in Large Graph Streams Including Edge Duplicates with a Fixed Memory Usage | 2018 | VLDB | 5.8519327e-05 |
| 4,726 | On Querying Connected Components in Large Temporal Graphs | 2023 | SIGMOD | 5.9632682e-05 |
| 5,043 | Better Algorithms for Counting Triangles in Data Streams | 2016 | PODS | 5.7350154e-05 |
| 3,067 | Sliding Window-based Approximate Triangle Counting over Streaming Graphs with Duplicate Edges | 2021 | SIGMOD | 7.6247945e-05 |
| 389 | Counting Triangles in Data Streams | 2006 | PODS | 0.00024649634 |
| 4,460 | Efficient Bi-triangle Counting for Large Bipartite Networks | 2021 | VLDB | 6.1592411e-05 |