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
- 4.1905499e-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 |
| 888 |
Maximum Biclique Search at Billion Scale |
2020 |
VLDB |
0.00015549756 |
| 3,369 |
Online Density Bursting Subgraph Detection from Temporal Graphs |
2019 |
VLDB |
7.1656755e-05 |
| 3,496 |
Efficient Maximal Biclique Enumeration for Large Sparse Bipartite Graphs |
2022 |
VLDB |
7.0376611e-05 |
| 4,158 |
Butterfly Counting on Uncertain Bipartite Graphs |
2022 |
VLDB |
6.3898204e-05 |
| 4,209 |
Mining Bursting Core in Large Temporal Graphs |
2022 |
VLDB |
6.3511029e-05 |
| 4,460 |
Efficient Bi-triangle Counting for Large Bipartite Networks |
2021 |
VLDB |
6.1592411e-05 |
| 4,484 |
Efficient Temporal Butterfly Counting and Enumeration on Temporal Bipartite Graphs |
2024 |
VLDB |
6.1426351e-05 |
| 5,548 |
Efficiently Answering Reachability and Path Queries on Temporal Bipartite Graphs |
2021 |
VLDB |
5.4445937e-05 |
| 5,644 |
FirmTruss Community Search in Multilayer Networks |
2023 |
VLDB |
5.3937466e-05 |
| 6,501 |
Reliable Community Search in Dynamic Networks |
2022 |
VLDB |
5.0293058e-05 |
| 7,753 |
ABC: Attributed Bipartite Co-clustering |
2022 |
VLDB |
4.6557125e-05 |
| 7,757 |
Identifying Similar-Bicliques in Bipartite Graphs |
2022 |
VLDB |
4.6554272e-05 |
| 8,920 |
Time-Topology Analysis |
2021 |
VLDB |
4.4229886e-05 |
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 7,757 |
Identifying Similar-Bicliques in Bipartite Graphs |
2022 |
VLDB |
4.6554272e-05 |
| 6,185 |
Efficient Core Maintenance in Large Bipartite Graphs |
2023 |
SIGMOD |
5.1618114e-05 |
| 10,189 |
Order-based Algorithms for Efficient Core Maintenance in Large Bipartite Graphs |
2026 |
SIGMOD |
4.1905499e-05 |
| 10,119 |
Theoretically and Practically Efficient Maximum Biclique Search |
2026 |
SIGMOD |
4.1905499e-05 |
| 10,134 |
A Unified Framework for Dense Subgraph Maintenance over Dynamic Bipartite Graphs |
2026 |
SIGMOD |
4.1905499e-05 |
| 10,312 |
Scalable Approximate Biclique Counting over Large Bipartite Graphs |
2026 |
VLDB |
4.1905499e-05 |
| 4,484 |
Efficient Temporal Butterfly Counting and Enumeration on Temporal Bipartite Graphs |
2024 |
VLDB |
6.1426351e-05 |
| 10,962 |
Efficient Maximal Biplex Enumerations with Improved Worst-Case Time Guarantee |
2024 |
SIGMOD |
4.1905499e-05 |
| 11,045 |
Efficient Index for Temporal Core Queries over Bipartite Graphs |
2024 |
VLDB |
4.1905499e-05 |
| 3,496 |
Efficient Maximal Biclique Enumeration for Large Sparse Bipartite Graphs |
2022 |
VLDB |
7.0376611e-05 |