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
- 2. Lijun Chang
- 3. Jeffrey Xu Yu
Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,078 | Estimating Biclique Counts with Accuracy Guarantees | 2026 | SIGMOD | 4.1945683e-05 |
| 10,530 | Most Similar Biclique Search at Scale | 2025 | VLDB | 4.1945683e-05 |
| 11,060 | Efficient Maximal Frequent Group Enumeration in Temporal Bipartite Graphs | 2024 | VLDB | 4.1945683e-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 |
|---|---|---|---|---|
| 777 | Local Graph Sparsification for Scalable Clustering | 2011 | SIGMOD | 0.0001679862 |
| 891 | Maximum Biclique Search at Billion Scale | 2020 | VLDB | 0.00015564292 |
| 4,485 | Parallel Index-Based Structural Graph Clustering and Its Approximation | 2021 | SIGMOD | 6.1458149e-05 |
Previous
Page 1 / 1
Next