Identifying Similar-Bicliques in Bipartite Graphs
Summary: Defines similar-bicliques in bipartite graphs: maximal bicliques with left-side vertices all similar, enabling direct enumeration. Introduces MSBE, a backtracking algorithm augmented with vertex reduction and a novel index to accelerate similarity checks and reductions; validated on 17 graphs and case studies. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Kai Yao (University of Sydney)
- 2. Lijun Chang (University of Sydney)
- 3. Jeffrey Xu Yu (Chinese University of Hong Kong)
BibTeX Citation
@article{yao_vldb22,
title = {{Identifying Similar-Bicliques in Bipartite Graphs}},
author = {Yao, Kai and Chang, Lijun and Yu, Jeffrey Xu},
journal = {PVLDB},
series = {{VLDB} '22},
volume = {15},
number = {11},
pages = {3085--3097},
doi = {10.14778/3551793.3551854},
url = {https://doi.org/10.14778/3551793.3551854},
year = {2022}
}Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,369 | Estimating Biclique Counts with Accuracy Guarantees | 2026 | SIGMOD | 5.093636e-05 |
| 10,802 | Most Similar Biclique Search at Scale | 2025 | VLDB | 5.093636e-05 |
| 11,267 | Efficient Maximal Frequent Group Enumeration in Temporal Bipartite Graphs | 2024 | VLDB | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 3 of 3 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 780 | Maximum Biclique Search at Billion Scale | 2020 | VLDB | 0.00014091815 |
| 1,163 | Local Graph Sparsification for Scalable Clustering | 2011 | SIGMOD | 0.00011865557 |
| 4,358 | Parallel Index-Based Structural Graph Clustering and Its Approximation | 2021 | SIGMOD | 6.7459836e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 11,173 | Efficient Maximal Biplex Enumerations with Improved Worst-Case Time Guarantee | 2024 | SIGMOD |
| 2 | 10,268 | Maximal Biclique Enumeration with Improved Worst-Case Time Complexity Guarantee: A Partition-Oriented Strategy | 2026 | SIGMOD |
| 3 | 10,598 | Scalable Approximate Biclique Counting over Large Bipartite Graphs | 2026 | VLDB |
| 4 | 9,049 | BCviz: A Linear-Space Index for Mining and Visualizing Cohesive Bipartite Subgraphs | 2025 | SIGMOD |
| 5 | 780 | Maximum Biclique Search at Billion Scale | 2020 | VLDB |
| 6 | 2,294 | (p,q)-biclique Counting and Enumeration for Large Sparse Bipartite Graphs | 2022 | VLDB |
| 7 | 1,884 | Efficient Exact Algorithms for Maximum Balanced Biclique Search in Bipartite Graphs | 2021 | SIGMOD |
| 8 | 10,407 | Theoretically and Practically Efficient Maximum Biclique Search | 2026 | SIGMOD |
| 9 | 10,802 | Most Similar Biclique Search at Scale | 2025 | VLDB |
| 10 | 2,860 | Efficient Maximal Biclique Enumeration for Large Sparse Bipartite Graphs | 2022 | VLDB |