BCviz: A Linear-Space Index for Mining and Visualizing Cohesive Bipartite Subgraphs
Summary: BCviz provides a linear-space, data-driven index for bipartite subgraphs, enabling exact maximum biclique search. A vertex order reveals density and connectivity to support connectivity-aware reduction, one-spot ordering, and linear-time bounds. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Jianxiong Ye (Harbin Engineering University)
- 2. Zhaonian Zou (Harbin Engineering University)
- 3. Dandan Liu (Harbin Engineering University)
- 4. Bin Yang (Harbin Engineering University)
- 5. Xudong Liu (Harbin Engineering University)
BibTeX Citation
@inproceedings{ye_sigmod25,
title = {{BCviz: A Linear-Space Index for Mining and Visualizing Cohesive Bipartite Subgraphs}},
author = {Ye, Jianxiong and Zou, Zhaonian and Liu, Dandan and Yang, Bin and Liu, Xudong},
series = {{SIGMOD} '25},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3709666},
url = {https://dl.acm.org/doi/10.1145/3709666},
year = {2025}
}
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,369 | Estimating Biclique Counts with Accuracy Guarantees | 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 | 10,802 | Most Similar Biclique Search at Scale | 2025 | VLDB |
| 2 | 10,478 | Order-based Algorithms for Efficient Core Maintenance in Large Bipartite Graphs | 2026 | SIGMOD |
| 3 | 8,149 | Efficient Index for Temporal Core Queries over Bipartite Graphs | 2024 | VLDB |
| 4 | 2,294 | (p,q)-biclique Counting and Enumeration for Large Sparse Bipartite Graphs | 2022 | VLDB |
| 5 | 780 | Maximum Biclique Search at Billion Scale | 2020 | VLDB |
| 6 | 1,884 | Efficient Exact Algorithms for Maximum Balanced Biclique Search in Bipartite Graphs | 2021 | SIGMOD |
| 7 | 10,407 | Theoretically and Practically Efficient Maximum Biclique Search | 2026 | SIGMOD |
| 8 | 10,308 | Zero-Redundancy Search for Bi-Components in Bipartite Graphs | 2026 | SIGMOD |
| 9 | 2,860 | Efficient Maximal Biclique Enumeration for Large Sparse Bipartite Graphs | 2022 | VLDB |
| 10 | 7,731 | Identifying Similar-Bicliques in Bipartite Graphs | 2022 | VLDB |