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
No non-self incoming citations found for this paper in this database.
Authors
- 1. Yalong Zhang
- 2. Rong-Hua Li
- 3. Qi Zhang
- 4. Hongchao Qin
- 5. Lu Qin
- 6. Guoren Wang
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 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 |
|---|---|---|---|---|
| 891 | Maximum Biclique Search at Billion Scale | 2020 | VLDB | 0.00015564292 |
| 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 |
| 3,802 | Group Recommendation: Semantics and Efficiency | 2009 | VLDB | 6.7552492e-05 |
| 6,183 | Efficient Core Maintenance in Large Bipartite Graphs | 2023 | SIGMOD | 5.1667703e-05 |
| 10,959 | Efficient Maximal Biplex Enumerations with Improved Worst-Case Time Guarantee | 2024 | SIGMOD | 4.1945683e-05 |
Previous
Page 1 / 1
Next