Back to papers
Efficient Maximal Frequent Group Enumeration in Temporal Bipartite Graphs
Summary: Introduce MFG: maximal λ-frequency groups in temporal bipartite graphs—V_S forms (τ_U,τ_V)-bicliques with some U on ≥λ timestamps, capturing unilateral temporal groups. Propose FilterV (Bron–Kerbosch with filters/array checks) and VFree, a verification-free O(|V|)-speedup; validated on 15 datasets.
(summarized by gpt-5-mini on Feb 09 2026)
- Paper ID
- 13538
- Venue
- VLDB
- Year
- 2024
- Pagerank
- 4.1945683e-05
- Overall Rank
- 11,060 | 23.06%
- DOI
-
10.14778/3681954.3681997
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
Outgoing Citations (Sorted by Pagerank)
Showing 13 of 13 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank |
Cited Paper |
Year |
Venue |
Pagerank |
| 891 |
Maximum Biclique Search at Billion Scale |
2020 |
VLDB |
0.00015564292 |
| 3,367 |
Online Density Bursting Subgraph Detection from Temporal Graphs |
2019 |
VLDB |
7.1725806e-05 |
| 3,492 |
Efficient Maximal Biclique Enumeration for Large Sparse Bipartite Graphs |
2022 |
VLDB |
7.044442e-05 |
| 4,171 |
Butterfly Counting on Uncertain Bipartite Graphs |
2022 |
VLDB |
6.3879236e-05 |
| 4,208 |
Mining Bursting Core in Large Temporal Graphs |
2022 |
VLDB |
6.357214e-05 |
| 4,459 |
Efficient Bi-triangle Counting for Large Bipartite Networks |
2021 |
VLDB |
6.1651553e-05 |
| 4,481 |
Efficient Temporal Butterfly Counting and Enumeration on Temporal Bipartite Graphs |
2024 |
VLDB |
6.1485442e-05 |
| 5,540 |
Efficiently Answering Reachability and Path Queries on Temporal Bipartite Graphs |
2021 |
VLDB |
5.4498271e-05 |
| 5,635 |
FirmTruss Community Search in Multilayer Networks |
2023 |
VLDB |
5.3989311e-05 |
| 6,506 |
Reliable Community Search in Dynamic Networks |
2022 |
VLDB |
5.0341364e-05 |
| 7,752 |
ABC: Attributed Bipartite Co-clustering |
2022 |
VLDB |
4.6601824e-05 |
| 7,757 |
Identifying Similar-Bicliques in Bipartite Graphs |
2022 |
VLDB |
4.6598957e-05 |
| 8,918 |
Time-Topology Analysis |
2021 |
VLDB |
4.427232e-05 |
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 7,757 |
Identifying Similar-Bicliques in Bipartite Graphs |
2022 |
VLDB |
4.6598957e-05 |
| 6,183 |
Efficient Core Maintenance in Large Bipartite Graphs |
2023 |
SIGMOD |
5.1667703e-05 |
| 10,189 |
Order-based Algorithms for Efficient Core Maintenance in Large Bipartite Graphs |
2026 |
SIGMOD |
4.1945683e-05 |
| 10,119 |
Theoretically and Practically Efficient Maximum Biclique Search |
2026 |
SIGMOD |
4.1945683e-05 |
| 10,134 |
A Unified Framework for Dense Subgraph Maintenance over Dynamic Bipartite Graphs |
2026 |
SIGMOD |
4.1945683e-05 |
| 10,300 |
Scalable Approximate Biclique Counting over Large Bipartite Graphs |
2026 |
VLDB |
4.1945683e-05 |
| 4,481 |
Efficient Temporal Butterfly Counting and Enumeration on Temporal Bipartite Graphs |
2024 |
VLDB |
6.1485442e-05 |
| 10,959 |
Efficient Maximal Biplex Enumerations with Improved Worst-Case Time Guarantee |
2024 |
SIGMOD |
4.1945683e-05 |
| 11,042 |
Efficient Index for Temporal Core Queries over Bipartite Graphs |
2024 |
VLDB |
4.1945683e-05 |
| 3,492 |
Efficient Maximal Biclique Enumeration for Large Sparse Bipartite Graphs |
2022 |
VLDB |
7.044442e-05 |