Efficient Maximal Frequent Group Enumeration in Temporal Bipartite Graphs
Summary: Introduces maximal λ-frequency groups for temporal bipartite graphs, capturing maximal one-layer vertex groups that participate in bicliques across at least λ timestamps. FilterV and verification-free VFree, built on Bron–Kerbosch and dynamic counting, enable scalable enumeration. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Yanping Wu (University of Technology Sydney)
- 2. Renjie Sun (East China Normal University)
- 3. Xiaoyang Wang (University of New South Wales)
- 4. Dong Wen (University of New South Wales)
- 5. Ying Zhang (University of Technology Sydney)
- 6. Lu Qin (University of Technology Sydney)
- 7. Xuemin Lin (Shanghai Jiao Tong University)
BibTeX Citation
@article{wu_vldb24,
title = {{Efficient Maximal Frequent Group Enumeration in Temporal Bipartite Graphs}},
author = {Wu, Yanping and Sun, Renjie and Wang, Xiaoyang and Wen, Dong and Zhang, Ying and Qin, Lu and Lin, Xuemin},
journal = {PVLDB},
series = {{VLDB} '24},
volume = {17},
number = {11},
pages = {3243--3255},
doi = {10.14778/3681954.3681997},
url = {https://doi.org/10.14778/3681954.3681997},
year = {2024}
}
Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 8,731 | Simpler is More: Efficient Top-K Nearest Neighbors Search on Large Road Networks | 2024 | VLDB | 5.3766157e-05 |
| 9,688 | Deep Overlapping Community Search via Subspace Embedding | 2025 | SIGMOD | 5.2351259e-05 |
| 10,408 | Time-Critical Influence Minimization via Node Blocking | 2026 | SIGMOD | 5.093636e-05 |
Previous
Page 1 / 1
Next
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.
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 5,674 | Efficient Core Maintenance in Large Bipartite Graphs | 2023 | SIGMOD |
| 2 | 10,478 | Order-based Algorithms for Efficient Core Maintenance in Large Bipartite Graphs | 2026 | SIGMOD |
| 3 | 10,407 | Theoretically and Practically Efficient Maximum Biclique Search | 2026 | SIGMOD |
| 4 | 10,268 | Maximal Biclique Enumeration with Improved Worst-Case Time Complexity Guarantee: A Partition-Oriented Strategy | 2026 | SIGMOD |
| 5 | 10,423 | A Unified Framework for Dense Subgraph Maintenance over Dynamic Bipartite Graphs | 2026 | SIGMOD |
| 6 | 10,598 | Scalable Approximate Biclique Counting over Large Bipartite Graphs | 2026 | VLDB |
| 7 | 3,911 | Efficient Temporal Butterfly Counting and Enumeration on Temporal Bipartite Graphs | 2024 | VLDB |
| 8 | 11,173 | Efficient Maximal Biplex Enumerations with Improved Worst-Case Time Guarantee | 2024 | SIGMOD |
| 9 | 8,149 | Efficient Index for Temporal Core Queries over Bipartite Graphs | 2024 | VLDB |
| 10 | 2,860 | Efficient Maximal Biclique Enumeration for Large Sparse Bipartite Graphs | 2022 | VLDB |