Efficient Core Maintenance in Large Bipartite Graphs

Summary: Introduces bi-core numbers for bipartite graphs and analyzes how edge updates alter vertex bi-core values, narrowing updates. Proposes fast (alpha,beta)-core maintenance for insertions/deletions; experiments show up to 100x speedup over prior work. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 6712
Venue: SIGMOD
Year: 2023
Pagerank: 5.1667703e-05
Overall Rank: 6,183 | 56.99%
DOI: 10.1145/3617329

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 6 of 6 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
6,513	Efficient Parallel D-core Decomposition at Scale	2024	VLDB	5.0321577e-05
10,134	A Unified Framework for Dense Subgraph Maintenance over Dynamic Bipartite Graphs	2026	SIGMOD	4.1945683e-05
10,189	Order-based Algorithms for Efficient Core Maintenance in Large Bipartite Graphs	2026	SIGMOD	4.1945683e-05
10,373	Density Decomposition of Bipartite Graphs	2025	SIGMOD	4.1945683e-05
10,681	Efficient k-Clique Densest Subgraph Discovery: Towards Bridging Practice and Theory	2025	VLDB	4.1945683e-05
11,042	Efficient Index for Temporal Core Queries over Bipartite Graphs	2024	VLDB	4.1945683e-05

Outgoing Citations (Sorted by Pagerank)

Showing 11 of 11 cited papers.

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

Rank	Cited Paper	Year	Venue	Pagerank
283	Querying K-Truss Community in Large and Dynamic Graphs	2014	SIGMOD	0.00029041257
1,637	Truss-based Community Search over Large Directed Graphs	2020	SIGMOD	0.0001105259
2,039	Local Algorithms for Hierarchical Dense Subgraph Discovery	2019	VLDB	9.7061003e-05
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
2,909	Efficient Algorithms for Densest Subgraph Discovery	2019	VLDB	7.9305767e-05
3,321	Hierarchical Core Maintenance on Large Dynamic Graphs	2021	VLDB	7.223972e-05
5,610	Influential Community Search over Large Heterogeneous Information Networks	2023	VLDB	5.4118541e-05
7,428	DLCR: Efficient Indexing for Label-Constrained Reachability Queries on Large Dynamic Graphs	2022	VLDB	4.7320892e-05
7,788	Towards Distributed Bitruss Decomposition on Bipartite Graphs	2022	VLDB	4.651009e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
10,945	Efficient High-Quality Clustering for Large Bipartite Graphs	2024	SIGMOD	4.1945683e-05
10,363	A Local Search Approach to Efficient (k, p)-Core Maintenance	2025	SIGMOD	4.1945683e-05
891	Maximum Biclique Search at Billion Scale	2020	VLDB	0.00015564292
10,159	Efficient Influential Community Search over Dynamic Graphs	2026	SIGMOD	4.1945683e-05
4,459	Efficient Bi-triangle Counting for Large Bipartite Networks	2021	VLDB	6.1651553e-05
3,321	Hierarchical Core Maintenance on Large Dynamic Graphs	2021	VLDB	7.223972e-05
11,042	Efficient Index for Temporal Core Queries over Bipartite Graphs	2024	VLDB	4.1945683e-05
10,373	Density Decomposition of Bipartite Graphs	2025	SIGMOD	4.1945683e-05
10,134	A Unified Framework for Dense Subgraph Maintenance over Dynamic Bipartite Graphs	2026	SIGMOD	4.1945683e-05
10,189	Order-based Algorithms for Efficient Core Maintenance in Large Bipartite Graphs	2026	SIGMOD	4.1945683e-05