DBScholar

Back to papers

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)

Paper ID
h75d022d2fd7d50ec
Venue
VLDB
Year
2024
Pagerank
4.9793485e-05
Overall Rank
11,595 | 22.05%
DOI
10.14778/3681954.3681997

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

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,895 Simpler is More: Efficient Top-K Nearest Neighbors Search on Large Road Networks 2024 VLDB 5.2559789e-05
9,864 Deep Overlapping Community Search via Subspace Embedding 2025 SIGMOD 5.1176637e-05
10,600 Time-Critical Influence Minimization via Node Blocking 2026 SIGMOD 4.9793485e-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