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)

Paper ID: 13744
Venue: VLDB
Year: 2024
Pagerank: 6.1485442e-05
Overall Rank: 4,481 | 68.83%
DOI: 10.14778/3636218.3636223

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 9 of 9 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
9,228	Efficiently Counting Triangles in Large Temporal Graphs	2025	SIGMOD	4.3690661e-05
10,258	TIMEST: Temporal Information Motif Estimator Using Sampling Trees	2026	VLDB	4.1945683e-05
10,300	Scalable Approximate Biclique Counting over Large Bipartite Graphs	2026	VLDB	4.1945683e-05
10,563	Efficient Historical Butterfly Counting in Large Temporal Bipartite Networks via Graph Structure-aware Index	2025	VLDB	4.1945683e-05
10,673	When Speed meets Accuracy: an Efficient and Effective Graph Model for Temporal Link Prediction	2025	VLDB	4.1945683e-05
10,871	Efficient Computation of Hyper-triangles on Hypergraphs	2025	VLDB	4.1945683e-05
11,042	Efficient Index for Temporal Core Queries over Bipartite Graphs	2024	VLDB	4.1945683e-05
11,044	Evolution Forest Index: Towards Optimal Temporal k-Core Component Search via Time-Topology Isomorphic Computation	2024	VLDB	4.1945683e-05
11,060	Efficient Maximal Frequent Group Enumeration in Temporal Bipartite Graphs	2024	VLDB	4.1945683e-05

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,484	Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks	2019	VLDB	0.00011714263
2,903	(p,q)-biclique Counting and Enumeration for Large Sparse Bipartite Graphs	2022	VLDB	7.9375744e-05
3,987	COMMIT: A Scalable Approach to Mining Communication Motifs from Dynamic Networks	2015	SIGMOD	6.5605514e-05
4,171	Butterfly Counting on Uncertain Bipartite Graphs	2022	VLDB	6.3879236e-05
5,474	Efficient Load-Balanced Butterfly Counting on GPU	2022	VLDB	5.4881807e-05
5,540	Efficiently Answering Reachability and Path Queries on Temporal Bipartite Graphs	2021	VLDB	5.4498271e-05
6,125	DenForest: Enabling Fast Deletion in Incremental Density-Based Clustering over Sliding Windows	2022	SIGMOD	5.1987868e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
11,060	Efficient Maximal Frequent Group Enumeration in Temporal Bipartite Graphs	2024	VLDB	4.1945683e-05
4,459	Efficient Bi-triangle Counting for Large Bipartite Networks	2021	VLDB	6.1651553e-05
5,474	Efficient Load-Balanced Butterfly Counting on GPU	2022	VLDB	5.4881807e-05
10,959	Efficient Maximal Biplex Enumerations with Improved Worst-Case Time Guarantee	2024	SIGMOD	4.1945683e-05
11,062	Maximum Balanced (k, e)-Bitruss Detection in Signed Bipartite Graph	2024	VLDB	4.1945683e-05
4,171	Butterfly Counting on Uncertain Bipartite Graphs	2022	VLDB	6.3879236e-05
5,773	I/O-Efficient Butterfly Counting at Scale	2023	SIGMOD	5.3319911e-05
7,451	Scalable Approximate Butterfly and Bi-triangle Counting for Large Bipartite Networks	2023	SIGMOD	4.7263711e-05
1,484	Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks	2019	VLDB	0.00011714263
10,563	Efficient Historical Butterfly Counting in Large Temporal Bipartite Networks via Graph Structure-aware Index	2025	VLDB	4.1945683e-05