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 7 of 7 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 6,617 | Efficient Parallel D-core Decomposition at Scale | 2024 | VLDB | 5.8212982e-05 |
| 8,149 | Efficient Index for Temporal Core Queries over Bipartite Graphs | 2024 | VLDB | 5.4784885e-05 |
| 9,689 | Density Decomposition of Bipartite Graphs | 2025 | SIGMOD | 5.2351259e-05 |
| 10,308 | Zero-Redundancy Search for Bi-Components in Bipartite Graphs | 2026 | SIGMOD | 5.093636e-05 |
| 10,423 | A Unified Framework for Dense Subgraph Maintenance over Dynamic Bipartite Graphs | 2026 | SIGMOD | 5.093636e-05 |
| 10,478 | Order-based Algorithms for Efficient Core Maintenance in Large Bipartite Graphs | 2026 | SIGMOD | 5.093636e-05 |
| 10,930 | Efficient k-Clique Densest Subgraph Discovery: Towards Bridging Practice and Theory | 2025 | VLDB | 5.093636e-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 | 10,656 | A Local Search Approach to Efficient (k, p)-Core Maintenance | 2025 | SIGMOD |
| 2 | 780 | Maximum Biclique Search at Billion Scale | 2020 | VLDB |
| 3 | 10,448 | Efficient Influential Community Search over Dynamic Graphs | 2026 | SIGMOD |
| 4 | 3,997 | Efficient Bi-triangle Counting for Large Bipartite Networks | 2021 | VLDB |
| 5 | 2,826 | Hierarchical Core Maintenance on Large Dynamic Graphs | 2021 | VLDB |
| 6 | 10,308 | Zero-Redundancy Search for Bi-Components in Bipartite Graphs | 2026 | SIGMOD |
| 7 | 8,149 | Efficient Index for Temporal Core Queries over Bipartite Graphs | 2024 | VLDB |
| 8 | 9,689 | Density Decomposition of Bipartite Graphs | 2025 | SIGMOD |
| 9 | 10,423 | A Unified Framework for Dense Subgraph Maintenance over Dynamic Bipartite Graphs | 2026 | SIGMOD |
| 10 | 10,478 | Order-based Algorithms for Efficient Core Maintenance in Large Bipartite Graphs | 2026 | SIGMOD |