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
- 13539
- Venue
- VLDB
- Year
- 2024
- Pagerank
- 5.1725247e-05
- Overall Rank
- 11,063 | 23.12%
- 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 |
| 844 |
Maximum Biclique Search at Billion Scale |
2020 |
VLDB |
0.00013704523 |
| 2,894 |
Online Density Bursting Subgraph Detection from Temporal Graphs |
2019 |
VLDB |
8.0548719e-05 |
| 3,121 |
Efficient Maximal Biclique Enumeration for Large Sparse Bipartite Graphs |
2022 |
VLDB |
7.7909091e-05 |
| 3,645 |
Mining Bursting Core in Large Temporal Graphs |
2022 |
VLDB |
7.3005709e-05 |
| 3,670 |
Butterfly Counting on Uncertain Bipartite Graphs |
2022 |
VLDB |
7.2766367e-05 |
| 3,885 |
Efficient Temporal Butterfly Counting and Enumeration on Temporal Bipartite Graphs |
2024 |
VLDB |
7.1048095e-05 |
| 4,018 |
Efficient Bi-triangle Counting for Large Bipartite Networks |
2021 |
VLDB |
7.0241264e-05 |
| 4,983 |
Efficiently Answering Reachability and Path Queries on Temporal Bipartite Graphs |
2021 |
VLDB |
6.4819742e-05 |
| 5,388 |
FirmTruss Community Search in Multilayer Networks |
2023 |
VLDB |
6.3077259e-05 |
| 6,061 |
Reliable Community Search in Dynamic Networks |
2022 |
VLDB |
6.0526093e-05 |
| 7,601 |
ABC: Attributed Bipartite Co-clustering |
2022 |
VLDB |
5.6439465e-05 |
| 7,606 |
Identifying Similar-Bicliques in Bipartite Graphs |
2022 |
VLDB |
5.6427542e-05 |
| 8,944 |
Time-Topology Analysis |
2021 |
VLDB |
5.4076395e-05 |
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 7,606 |
Identifying Similar-Bicliques in Bipartite Graphs |
2022 |
VLDB |
5.6427542e-05 |
| 6,062 |
Efficient Core Maintenance in Large Bipartite Graphs |
2023 |
SIGMOD |
6.0525723e-05 |
| 10,189 |
Order-based Algorithms for Efficient Core Maintenance in Large Bipartite Graphs |
2026 |
SIGMOD |
5.1725247e-05 |
| 10,119 |
Theoretically and Practically Efficient Maximum Biclique Search |
2026 |
SIGMOD |
5.1725247e-05 |
| 10,134 |
A Unified Framework for Dense Subgraph Maintenance over Dynamic Bipartite Graphs |
2026 |
SIGMOD |
5.1725247e-05 |
| 10,312 |
Scalable Approximate Biclique Counting over Large Bipartite Graphs |
2026 |
VLDB |
5.1725247e-05 |
| 3,885 |
Efficient Temporal Butterfly Counting and Enumeration on Temporal Bipartite Graphs |
2024 |
VLDB |
7.1048095e-05 |
| 10,962 |
Efficient Maximal Biplex Enumerations with Improved Worst-Case Time Guarantee |
2024 |
SIGMOD |
5.1725247e-05 |
| 11,045 |
Efficient Index for Temporal Core Queries over Bipartite Graphs |
2024 |
VLDB |
5.1725247e-05 |
| 3,121 |
Efficient Maximal Biclique Enumeration for Large Sparse Bipartite Graphs |
2022 |
VLDB |
7.7909091e-05 |