Order-based Algorithms for Efficient Core Maintenance in Large Bipartite Graphs
Summary: The paper gives the first boundedness analysis of dynamic bi-core maintenance, showing deletions are bounded but insertions are inherently unbounded. It introduces BD-Order plus an order-based update algorithm (with an auxiliary deletion structure) that sharply localizes affected vertices and yields up to 100× speedups. (summarized by gpt-5-mini on Apr 11 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Qiaoyuan Yang
- 2. Wensheng Luo
- 3. Yixiang Fang
- 4. Yuanyuan Zeng
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
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.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 283 | Querying K-Truss Community in Large and Dynamic Graphs | 2014 | SIGMOD | 0.00029041257 |
| 891 | Maximum Biclique Search at Billion Scale | 2020 | VLDB | 0.00015564292 |
| 966 | Streaming Algorithms for k-core Decomposition | 2013 | VLDB | 0.00014960672 |
| 1,720 | Incremental Graph Pattern Matching | 2011 | SIGMOD | 0.00010779343 |
| 2,846 | Unboundedness and Efficiency of Truss Maintenance in Evolving Graphs | 2019 | SIGMOD | 8.0234377e-05 |
| 3,394 | Incremental Graph Computations: Doable and Undoable | 2017 | SIGMOD | 7.1480446e-05 |
| 6,183 | Efficient Core Maintenance in Large Bipartite Graphs | 2023 | SIGMOD | 5.1667703e-05 |
| 8,014 | Efficient Star-based Truss Maintenance on Dynamic Graphs | 2023 | SIGMOD | 4.6058845e-05 |
| 8,169 | Efficient Triangle-Connected Truss Community Search In Dynamic Graphs | 2023 | VLDB | 4.5698941e-05 |
| 9,403 | A Counting-based Approach for Efficient k-Clique Densest Subgraph Discovery | 2024 | SIGMOD | 4.3441378e-05 |
| 10,072 | Efficient and Scalable Directed Densest Subgraph Discovery | 2026 | SIGMOD | 4.1945683e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3,492 | Efficient Maximal Biclique Enumeration for Large Sparse Bipartite Graphs | 2022 | VLDB | 7.044442e-05 |
| 10,959 | Efficient Maximal Biplex Enumerations with Improved Worst-Case Time Guarantee | 2024 | SIGMOD | 4.1945683e-05 |
| 891 | Maximum Biclique Search at Billion Scale | 2020 | VLDB | 0.00015564292 |
| 4,459 | Efficient Bi-triangle Counting for Large Bipartite Networks | 2021 | VLDB | 6.1651553e-05 |
| 10,159 | Efficient Influential Community Search over Dynamic Graphs | 2026 | SIGMOD | 4.1945683e-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 |
| 6,183 | Efficient Core Maintenance in Large Bipartite Graphs | 2023 | SIGMOD | 5.1667703e-05 |