Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks
Summary: Introduces BFC-VP, a vertex-priority paradigm for butterfly counting that enumerates substantially fewer wedges than layer-priority methods. Cache-aware, external-memory, and parallel variants preserve its complexity and deliver up to 100× speedups on real networks. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Kai Wang (University of New South Wales; Zhejiang Lab)
- 2. Xuemin Lin (University of New South Wales; Zhejiang Lab)
- 3. Lu Qin (University of Technology Sydney)
- 4. Wenjie Zhang (University of New South Wales; Zhejiang Lab)
- 5. Ying Zhang (University of Technology Sydney)
BibTeX Citation
@article{wang_vldb19,
title = {{Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks}},
author = {Wang, Kai and Lin, Xuemin and Qin, Lu and Zhang, Wenjie and Zhang, Ying},
journal = {PVLDB},
series = {{VLDB} '19},
volume = {12},
number = {10},
pages = {1139--1152},
doi = {10.14778/3339490.3339497},
url = {https://doi.org/10.14778/3339490.3339497},
year = {2019}
}Incoming Citations (Sorted by Pagerank)
Showing 32 of 32 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 9 of 9 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 110 | DBMSs On A Modern Processor: Where Does Time Go? | 1999 | VLDB | 0.00032696785 |
| 600 | Massive Graph Triangulation | 2013 | SIGMOD | 0.00015733864 |
| 834 | K-Core Decomposition of Large Networks on a Single PC | 2016 | VLDB | 0.00013576778 |
| 1,438 | Speedup Graph Processing by Graph Ordering | 2016 | SIGMOD | 0.00010647473 |
| 1,443 | The More the Merrier: Efficient Multi-Source Graph Traversal | 2015 | VLDB | 0.00010634797 |
| 1,626 | More is Simpler: Effectively and Efficiently Assessing Node-Pair Similarities Based on Hyperlinks | 2014 | VLDB | 0.00010039008 |
| 1,853 | Speeding Up Set Intersections in Graph Algorithms using SIMD Instructions | 2018 | SIGMOD | 9.499042e-05 |
| 4,095 | When Engagement Meets Similarity: Efficient (k,r)-Core Computation on Social Networks | 2017 | VLDB | 6.8091843e-05 |
| 14,024 | MapDupReducer: Detecting Near Duplicates over Massive Datasets | 2010 | SIGMOD | - |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 4,224 | Efficient Biclique Counting in Large Bipartite Graphs | 2023 | SIGMOD |
| 2 | 7,284 | Towards Distributed Bitruss Decomposition on Bipartite Graphs | 2022 | VLDB |
| 3 | 11,603 | Maximum Balanced (k, epsilon)-Bitruss Detection in Signed Bipartite Graph | 2024 | VLDB |
| 4 | 4,045 | Efficient Bi-triangle Counting for Large Bipartite Networks | 2021 | VLDB |
| 5 | 3,797 | Butterfly Counting on Uncertain Bipartite Graphs | 2022 | VLDB |
| 6 | 5,560 | I/O-Efficient Butterfly Counting at Scale | 2023 | SIGMOD |
| 7 | 5,141 | Efficient Load-Balanced Butterfly Counting on GPU | 2022 | VLDB |
| 8 | 10,106 | Efficient Historical Butterfly Counting in Large Temporal Bipartite Networks via Graph Structure-aware Index | 2025 | VLDB |
| 9 | 3,890 | Efficient Temporal Butterfly Counting and Enumeration on Temporal Bipartite Graphs | 2024 | VLDB |
| 10 | 7,608 | Scalable Approximate Butterfly and Bi-triangle Counting for Large Bipartite Networks | 2023 | SIGMOD |