Density Decomposition of Bipartite Graphs
Summary: New (alpha, beta)-dense subgraph model for bipartite graphs, yielding a hierarchical density decomposition. Network-flow with core pruning extracts (alpha,beta)-dense subgraphs in O(|E|+|E(R)|^1.5); divide-and-conquer computes the full decomposition in O(p log d_max |E|^1.5). Evaluated on 11 real datasets. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Yalong Zhang (Beijing Institute of Technology)
- 2. Rong-Hua Li (Beijing Institute of Technology)
- 3. Qi Zhang (Beijing Institute of Technology)
- 4. Hongchao Qin (Beijing Institute of Technology)
- 5. Lu Qin (University of Technology Sydney)
- 6. Guoren Wang (Beijing Institute of Technology)
BibTeX Citation
@inproceedings{zhang_sigmod25,
title = {{Density Decomposition of Bipartite Graphs}},
author = {Zhang, Yalong and Li, Rong-Hua and Zhang, Qi and Qin, Hongchao and Qin, Lu and Wang, Guoren},
series = {{SIGMOD} '25},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3709680},
url = {https://dl.acm.org/doi/10.1145/3709680},
year = {2025}
}Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,308 | Zero-Redundancy Search for Bi-Components in Bipartite Graphs | 2026 | SIGMOD | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 6 of 6 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 780 | Maximum Biclique Search at Billion Scale | 2020 | VLDB | 0.00014091815 |
| 2,294 | (p,q)-biclique Counting and Enumeration for Large Sparse Bipartite Graphs | 2022 | VLDB | 8.7939844e-05 |
| 2,453 | Efficient Algorithms for Maximal k-Biplex Enumeration | 2022 | SIGMOD | 8.5574945e-05 |
| 3,608 | Group Recommendation: Semantics and Efficiency | 2009 | VLDB | 7.2609441e-05 |
| 5,674 | Efficient Core Maintenance in Large Bipartite Graphs | 2023 | SIGMOD | 6.1255689e-05 |
| 11,173 | Efficient Maximal Biplex Enumerations with Improved Worst-Case Time Guarantee | 2024 | SIGMOD | 5.093636e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 780 | Maximum Biclique Search at Billion Scale | 2020 | VLDB |
| 2 | 2,024 | Efficient Algorithms for Densest Subgraph Discovery | 2019 | VLDB |
| 3 | 11,173 | Efficient Maximal Biplex Enumerations with Improved Worst-Case Time Guarantee | 2024 | SIGMOD |
| 4 | 10,308 | Zero-Redundancy Search for Bi-Components in Bipartite Graphs | 2026 | SIGMOD |
| 5 | 3,737 | Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs | 2020 | SIGMOD |
| 6 | 10,423 | A Unified Framework for Dense Subgraph Maintenance over Dynamic Bipartite Graphs | 2026 | SIGMOD |
| 7 | 10,478 | Order-based Algorithms for Efficient Core Maintenance in Large Bipartite Graphs | 2026 | SIGMOD |
| 8 | 10,767 | Integral Densest Subgraph Search on Directed Graphs | 2025 | SIGMOD |
| 9 | 5,674 | Efficient Core Maintenance in Large Bipartite Graphs | 2023 | SIGMOD |
| 10 | 11,256 | Efficient Algorithms for Density Decomposition on Large Static and Dynamic Graphs | 2024 | VLDB |