Most Similar Biclique Search at Scale

Summary: Proposes the "most similar biclique" objective (local: containing query q; global: highest vertex similarity) to find high-similarity bicliques as more meaningful bipartite communities than max-edge bicliques. Develops Mosib, an exact solver with three graph-reduction and two similarity-first search rules, and Mosib-GloApp, a MinHash-based approximate divider for scalable global search, demonstrating practical efficiency on real networks. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID: 13775
Venue: VLDB
Year: 2025
Pagerank: 4.1945683e-05
Overall Rank: 10,530 | 26.75%
DOI: 10.14778/3717755.3717763

Incoming Non-self Citations Over Time

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

Authors

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank

Outgoing Citations (Sorted by Pagerank)

Showing 12 of 12 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank	Cited Paper	Year	Venue	Pagerank
108	Truss Decomposition in Massive Networks	2012	VLDB	0.00048300163
331	The Ubiquity of Large Graphs and Surprising Challenges of Graph Processing	2018	VLDB	0.00027214222
396	One Trillion Edges: Graph Processing at Facebook-Scale	2015	VLDB	0.00024424102
686	Finding Maximal Cliques in Massive Networks by H*-graph	2010	SIGMOD	0.00018178029
847	Finding the Maximum Clique in Massive Graphs	2017	VLDB	0.00015993322
891	Maximum Biclique Search at Billion Scale	2020	VLDB	0.00015564292
1,150	K-Core Decomposition of Large Networks on a Single PC	2016	VLDB	0.00013657353
2,225	Efficient Exact Algorithms for Maximum Balanced Biclique Search in Bipartite Graphs	2021	SIGMOD	9.2479064e-05
3,492	Efficient Maximal Biclique Enumeration for Large Sparse Bipartite Graphs	2022	VLDB	7.044442e-05
4,394	When Engagement Meets Similarity: Efficient (k,r)-Core Computation on Social Networks	2017	VLDB	6.224902e-05
7,757	Identifying Similar-Bicliques in Bipartite Graphs	2022	VLDB	4.6598957e-05
11,005	Influence Maximization via Vertex Countering	2024	VLDB	4.1945683e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
9,935	Fast Maximum Common Subgraph Search: A Redundancy-Reduced Backtracking Approach	2025	SIGMOD	4.2482599e-05
10,373	Density Decomposition of Bipartite Graphs	2025	SIGMOD	4.1945683e-05
3,492	Efficient Maximal Biclique Enumeration for Large Sparse Bipartite Graphs	2022	VLDB	7.044442e-05
847	Finding the Maximum Clique in Massive Graphs	2017	VLDB	0.00015993322
10,300	Scalable Approximate Biclique Counting over Large Bipartite Graphs	2026	VLDB	4.1945683e-05
8,897	BCviz: A Linear-Space Index for Mining and Visualizing Cohesive Bipartite Subgraphs	2025	SIGMOD	4.427232e-05
2,225	Efficient Exact Algorithms for Maximum Balanced Biclique Search in Bipartite Graphs	2021	SIGMOD	9.2479064e-05
891	Maximum Biclique Search at Billion Scale	2020	VLDB	0.00015564292
10,119	Theoretically and Practically Efficient Maximum Biclique Search	2026	SIGMOD	4.1945683e-05
7,757	Identifying Similar-Bicliques in Bipartite Graphs	2022	VLDB	4.6598957e-05