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)

Paper ID: 7015
Venue: SIGMOD
Year: 2025
Pagerank: 4.427232e-05
Overall Rank: 8,897 | 38.11%
DOI: 10.1145/3709666

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
10,078	Estimating Biclique Counts with Accuracy Guarantees	2026	SIGMOD	4.1945683e-05

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.

Rank	Cited Paper	Year	Venue	Pagerank
891	Maximum Biclique Search at Billion Scale	2020	VLDB	0.00015564292
2,225	Efficient Exact Algorithms for Maximum Balanced Biclique Search in Bipartite Graphs	2021	SIGMOD	9.2479064e-05
2,521	Efficient Algorithms for Maximal k-Biplex Enumeration	2022	SIGMOD	8.6065919e-05
2,903	(p,q)-biclique Counting and Enumeration for Large Sparse Bipartite Graphs	2022	VLDB	7.9375744e-05
3,020	GConnect: A Connectivity Index for Massive Disk-Resident Graphs	2009	VLDB	7.6992238e-05
3,480	CSV: Visualizing and Mining Cohesive Subgraphs	2008	SIGMOD	7.0538737e-05
3,492	Efficient Maximal Biclique Enumeration for Large Sparse Bipartite Graphs	2022	VLDB	7.044442e-05
3,854	Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity	2015	SIGMOD	6.6988744e-05
4,626	Efficient Biclique Counting in Large Bipartite Graphs	2023	SIGMOD	6.0399035e-05
5,540	Efficiently Answering Reachability and Path Queries on Temporal Bipartite Graphs	2021	VLDB	5.4498271e-05
6,532	Hereditary Cohesive Subgraphs Enumeration on Bipartite Graphs: The Power of Pivot-based Approaches	2023	SIGMOD	5.0245678e-05
7,788	Towards Distributed Bitruss Decomposition on Bipartite Graphs	2022	VLDB	4.651009e-05
8,630	A Near-Optimal Approach to Edge Connectivity-Based Hierarchical Graph Decomposition	2022	VLDB	4.480887e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
10,373	Density Decomposition of Bipartite Graphs	2025	SIGMOD	4.1945683e-05
10,530	Most Similar Biclique Search at Scale	2025	VLDB	4.1945683e-05
10,189	Order-based Algorithms for Efficient Core Maintenance in Large Bipartite Graphs	2026	SIGMOD	4.1945683e-05
11,042	Efficient Index for Temporal Core Queries over Bipartite Graphs	2024	VLDB	4.1945683e-05
2,903	(p,q)-biclique Counting and Enumeration for Large Sparse Bipartite Graphs	2022	VLDB	7.9375744e-05
891	Maximum Biclique Search at Billion Scale	2020	VLDB	0.00015564292
2,225	Efficient Exact Algorithms for Maximum Balanced Biclique Search in Bipartite Graphs	2021	SIGMOD	9.2479064e-05
10,119	Theoretically and Practically Efficient Maximum Biclique Search	2026	SIGMOD	4.1945683e-05
3,492	Efficient Maximal Biclique Enumeration for Large Sparse Bipartite Graphs	2022	VLDB	7.044442e-05
7,757	Identifying Similar-Bicliques in Bipartite Graphs	2022	VLDB	4.6598957e-05