Efficient Bi-triangle Counting for Large Bipartite Networks
Summary: Efficient bi-triangle counting in large bipartite networks; a bi-triangle is a six-node cycle with three vertices from each part. From a baseline of joining three wedges, it uses two super-wedges with degree-based ranking, yielding up to five orders of magnitude speedups on graphs with >1e9 edges. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Yixing Yang (University of New South Wales)
- 2. Yixiang Fang (University of New South Wales)
- 3. Maria E. Orlowska (Polish-Japanese Institute of Information Technology)
- 4. Wenjie Zhang (University of New South Wales)
- 5. Xuemin Lin (University of New South Wales)
BibTeX Citation
@article{yang_vldb21,
title = {{Efficient Bi-triangle Counting for Large Bipartite Networks}},
author = {Yang, Yixing and Fang, Yixiang and Orlowska, Maria E. and Zhang, Wenjie and Lin, Xuemin},
journal = {PVLDB},
series = {{VLDB} '21},
doi = {10.14778/3447689.3447702},
url = {https://doi.org/10.14778/3447689.3447702},
year = {2021}
}Incoming Citations (Sorted by Pagerank)
Showing 12 of 12 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 10 of 10 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 | 594 | Massive Graph Triangulation | 2013 | SIGMOD |
| 2 | 458 | Counting Triangles in Data Streams | 2006 | PODS |
| 3 | 5,674 | Efficient Core Maintenance in Large Bipartite Graphs | 2023 | SIGMOD |
| 4 | 4,143 | Efficient Biclique Counting in Large Bipartite Graphs | 2023 | SIGMOD |
| 5 | 2,860 | Efficient Maximal Biclique Enumeration for Large Sparse Bipartite Graphs | 2022 | VLDB |
| 6 | 11,094 | Efficient Computation of Hyper-triangles on Hypergraphs | 2025 | VLDB |
| 7 | 1,211 | Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks | 2019 | VLDB |
| 8 | 10,598 | Scalable Approximate Biclique Counting over Large Bipartite Graphs | 2026 | VLDB |
| 9 | 9,375 | Efficiently Counting Triangles in Large Temporal Graphs | 2025 | SIGMOD |
| 10 | 7,455 | Scalable Approximate Butterfly and Bi-triangle Counting for Large Bipartite Networks | 2023 | SIGMOD |