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)
Incoming Non-self Citations Over Time
Authors
- 1. Wensheng Luo (Chinese University of Hong Kong)
- 2. Qiaoyuan Yang (Chinese University of Hong Kong)
- 3. Yixiang Fang (Chinese University of Hong Kong)
- 4. Xu Zhou (Hunan University)
BibTeX Citation
@inproceedings{luo_sigmod23,
title = {{Efficient Core Maintenance in Large Bipartite Graphs}},
author = {Luo, Wensheng and Yang, Qiaoyuan and Fang, Yixiang and Zhou, Xu},
series = {{SIGMOD} '23},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3617329},
url = {https://dl.acm.org/doi/10.1145/3617329},
year = {2023}
}
Incoming Citations (Sorted by Pagerank)
Showing 8 of 8 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 6,651 | Efficient Parallel D-core Decomposition at Scale | 2024 | VLDB | 5.7203229e-05 |
| 8,318 | Efficient Index for Temporal Core Queries over Bipartite Graphs | 2024 | VLDB | 5.3555659e-05 |
| 9,865 | Density Decomposition of Bipartite Graphs | 2025 | SIGMOD | 5.1176637e-05 |
| 10,519 | Zero-Redundancy Search for Bi-Components in Bipartite Graphs | 2026 | SIGMOD | 4.9793485e-05 |
| 10,612 | A Unified Framework for Dense Subgraph Maintenance over Dynamic Bipartite Graphs | 2026 | SIGMOD | 4.9793485e-05 |
| 10,665 | Order-based Algorithms for Efficient Core Maintenance in Large Bipartite Graphs | 2026 | SIGMOD | 4.9793485e-05 |
| 10,939 | BiLink: Bidirectional Meta-paths for Link Discovery in Billion-Scale Heterogeneous Graphs | 2026 | VLDB | 4.9793485e-05 |
| 11,321 | Efficient k-Clique Densest Subgraph Discovery: Towards Bridging Practice and Theory | 2025 | VLDB | 4.9793485e-05 |
Previous
Page 1 / 1
Next
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.
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 766 | Maximum Biclique Search at Billion Scale | 2020 | VLDB |
| 2 | 10,636 | Efficient Influential Community Search over Dynamic Graphs | 2026 | SIGMOD |
| 3 | 4,044 | Efficient Bi-triangle Counting for Large Bipartite Networks | 2021 | VLDB |
| 4 | 2,869 | Hierarchical Core Maintenance on Large Dynamic Graphs | 2021 | VLDB |
| 5 | 10,519 | Zero-Redundancy Search for Bi-Components in Bipartite Graphs | 2026 | SIGMOD |
| 6 | 10,860 | Maximum Defective Biclique Search in Large Bipartite Graphs | 2026 | VLDB |
| 7 | 8,318 | Efficient Index for Temporal Core Queries over Bipartite Graphs | 2024 | VLDB |
| 8 | 9,865 | Density Decomposition of Bipartite Graphs | 2025 | SIGMOD |
| 9 | 10,612 | A Unified Framework for Dense Subgraph Maintenance over Dynamic Bipartite Graphs | 2026 | SIGMOD |
| 10 | 10,665 | Order-based Algorithms for Efficient Core Maintenance in Large Bipartite Graphs | 2026 | SIGMOD |