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)

Paper ID: 12611
Venue: VLDB
Year: 2021
Pagerank: 6.1651553e-05
Overall Rank: 4,459 | 68.99%
DOI: -

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 12 of 12 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
2,650	Detecting Logic Bugs of Join Optimizations in DBMS	2023	SIGMOD	8.3708191e-05
2,903	(p,q)-biclique Counting and Enumeration for Large Sparse Bipartite Graphs	2022	VLDB	7.9375744e-05
3,492	Efficient Maximal Biclique Enumeration for Large Sparse Bipartite Graphs	2022	VLDB	7.044442e-05
4,626	Efficient Biclique Counting in Large Bipartite Graphs	2023	SIGMOD	6.0399035e-05
4,743	Cohesive Subgraph Search over Big Heterogeneous Information Networks: Applications, Challenges, and Solutions	2021	SIGMOD	5.9586508e-05
4,843	Butterfly-Core Community Search over Labeled Graphs	2021	VLDB	5.8823824e-05
5,540	Efficiently Answering Reachability and Path Queries on Temporal Bipartite Graphs	2021	VLDB	5.4498271e-05
7,451	Scalable Approximate Butterfly and Bi-triangle Counting for Large Bipartite Networks	2023	SIGMOD	4.7263711e-05
10,258	TIMEST: Temporal Information Motif Estimator Using Sampling Trees	2026	VLDB	4.1945683e-05
10,563	Efficient Historical Butterfly Counting in Large Temporal Bipartite Networks via Graph Structure-aware Index	2025	VLDB	4.1945683e-05
11,042	Efficient Index for Temporal Core Queries over Bipartite Graphs	2024	VLDB	4.1945683e-05
11,060	Efficient Maximal Frequent Group Enumeration in Temporal Bipartite Graphs	2024	VLDB	4.1945683e-05

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.

Rank	Cited Paper	Year	Venue	Pagerank
283	Querying K-Truss Community in Large and Dynamic Graphs	2014	SIGMOD	0.00029041257
612	Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism	2008	VLDB	0.0001920234
764	TurboISO: Towards UltraFast and Robust Subgraph Isomorphism Search in Large Graph Databases	2013	SIGMOD	0.00017018712
1,484	Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks	2019	VLDB	0.00011714263
1,645	Attribute-Driven Community Search	2017	VLDB	0.00011037459
2,286	Effective and Efficient Community Search over Large Heterogeneous Information Networks	2020	VLDB	9.0982591e-05
2,684	Truss Decomposition of Probabilistic Graphs: Semantics and Algorithms	2016	SIGMOD	8.3136866e-05
2,909	Efficient Algorithms for Densest Subgraph Discovery	2019	VLDB	7.9305767e-05
2,910	DUALSIM: Parallel Subgraph Enumeration in a Massive Graph on a Single Machine	2016	SIGMOD	7.9266529e-05
4,556	Distributed Subgraph Matching on Timely Dataflow	2019	VLDB	6.0883757e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
589	Massive Graph Triangulation	2013	SIGMOD	0.00019576567
392	Counting Triangles in Data Streams	2006	PODS	0.00024556183
6,183	Efficient Core Maintenance in Large Bipartite Graphs	2023	SIGMOD	5.1667703e-05
4,626	Efficient Biclique Counting in Large Bipartite Graphs	2023	SIGMOD	6.0399035e-05
3,492	Efficient Maximal Biclique Enumeration for Large Sparse Bipartite Graphs	2022	VLDB	7.044442e-05
10,871	Efficient Computation of Hyper-triangles on Hypergraphs	2025	VLDB	4.1945683e-05
1,484	Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks	2019	VLDB	0.00011714263
10,300	Scalable Approximate Biclique Counting over Large Bipartite Graphs	2026	VLDB	4.1945683e-05
9,228	Efficiently Counting Triangles in Large Temporal Graphs	2025	SIGMOD	4.3690661e-05
7,451	Scalable Approximate Butterfly and Bi-triangle Counting for Large Bipartite Networks	2023	SIGMOD	4.7263711e-05