DBScholar

Back to papers

Efficient Historical Butterfly Counting in Large Temporal Bipartite Networks via Graph Structure-aware Index

Summary: Proposes the first graph-structure-aware indexing for historical butterfly counting in temporal bipartite networks, combining two novel indices whose space scales with counts of butterflies and wedges. Adds index compression and unbiased approximation, proves asymptotic gains on power-law graphs, and achieves up to 10^5x query speedups with modest memory. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
14011
Venue
VLDB
Year
2025
Pagerank
5.1955087e-05
Overall Rank
9,916 | 31.97%
DOI
10.14778/3725688.3725693

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{mang_vldb25,
        title = {{Efficient Historical Butterfly Counting in Large Temporal Bipartite Networks via Graph Structure-aware Index}},
        author = {Mang, Qiuyang and Chen, Jingbang and Zhou, Hangrui and Gao, Yu and Zhou, Yingli and Shi, Qingyu and Peng, Richard and Fang, Yixiang and Ma, Chenhao},
        journal = {PVLDB},
        series = {{VLDB} '25},
        volume = {18},
        number = {6},
        pages = {1607--1620},
        doi = {10.14778/3725688.3725693},
        url = {https://doi.org/10.14778/3725688.3725693},
        year = {2025}
}

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
10,283 Querying Cohesive Subgraphs in Temporal Graphs 2026 SIGMOD 5.093636e-05
10,598 Scalable Approximate Biclique Counting over Large Bipartite Graphs 2026 VLDB 5.093636e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 11 of 11 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