Efficient Temporal Butterfly Counting and Enumeration on Temporal Bipartite Graphs
Summary: Presents the first algorithms for temporal butterfly (2,2)-biclique counting and enumeration in bipartite graphs, defining butterflies by edge-order within a time window. Introduces a compact index and priority strategy that is provably faster and supports streaming and multicore. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Xinwei Cai (Zhejiang University)
- 2. Xiangyu Ke (Zhejiang University)
- 3. Kai Wang (Shanghai Jiao Tong University)
- 4. Lu Chen (Zhejiang University)
- 5. Tianming Zhang (Zhejiang University)
- 6. Qing Liu (Zhejiang University)
- 7. Yunjun Gao (Zhejiang University)
BibTeX Citation
@article{cai_vldb24,
title = {{Efficient Temporal Butterfly Counting and Enumeration on Temporal Bipartite Graphs}},
author = {Cai, Xinwei and Ke, Xiangyu and Wang, Kai and Chen, Lu and Zhang, Tianming and Liu, Qing and Gao, Yunjun},
journal = {PVLDB},
series = {{VLDB} '24},
volume = {17},
number = {4},
pages = {657--670},
doi = {10.14778/3636218.3636223},
url = {https://doi.org/10.14778/3636218.3636223},
year = {2024}
}Incoming Citations (Sorted by Pagerank)
Showing 9 of 9 citing papers.
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 |
|---|---|---|---|---|
| 1,211 | Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks | 2019 | VLDB | 0.00011648789 |
| 2,294 | (p,q)-biclique Counting and Enumeration for Large Sparse Bipartite Graphs | 2022 | VLDB | 8.7939844e-05 |
| 3,439 | COMMIT: A Scalable Approach to Mining Communication Motifs from Dynamic Networks | 2015 | SIGMOD | 7.4144782e-05 |
| 3,723 | Butterfly Counting on Uncertain Bipartite Graphs | 2022 | VLDB | 7.1725638e-05 |
| 5,044 | Efficiently Answering Reachability and Path Queries on Temporal Bipartite Graphs | 2021 | VLDB | 6.3883109e-05 |
| 5,317 | Efficient Load-Balanced Butterfly Counting on GPU | 2022 | VLDB | 6.2685847e-05 |
| 5,483 | DenForest: Enabling Fast Deletion in Incremental Density-Based Clustering over Sliding Windows | 2022 | SIGMOD | 6.2019677e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 11,267 | Efficient Maximal Frequent Group Enumeration in Temporal Bipartite Graphs | 2024 | VLDB |
| 2 | 3,997 | Efficient Bi-triangle Counting for Large Bipartite Networks | 2021 | VLDB |
| 3 | 5,317 | Efficient Load-Balanced Butterfly Counting on GPU | 2022 | VLDB |
| 4 | 11,173 | Efficient Maximal Biplex Enumerations with Improved Worst-Case Time Guarantee | 2024 | SIGMOD |
| 5 | 11,269 | Maximum Balanced (k, epsilon)-Bitruss Detection in Signed Bipartite Graph | 2024 | VLDB |
| 6 | 3,723 | Butterfly Counting on Uncertain Bipartite Graphs | 2022 | VLDB |
| 7 | 5,427 | I/O-Efficient Butterfly Counting at Scale | 2023 | SIGMOD |
| 8 | 7,455 | Scalable Approximate Butterfly and Bi-triangle Counting for Large Bipartite Networks | 2023 | SIGMOD |
| 9 | 1,211 | Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks | 2019 | VLDB |
| 10 | 9,916 | Efficient Historical Butterfly Counting in Large Temporal Bipartite Networks via Graph Structure-aware Index | 2025 | VLDB |