7 citations · 7 across the 14 of their papers we have counts for
Showing 2024Show all
2 papers · 1 filter
cs.DB2024
In-depth Analysis of Densest Subgraph Discovery in a Unified Framework
Yingli Zhou, Qingshuo Guo, Yi Yang +3
As a fundamental topic in graph mining, Densest Subgraph Discovery (DSD) has found a wide spectrum of real applications. Several DSD algorithms, including exact and approximation a…
cs.SI2024
Efficient Historical Butterfly Counting in Large Temporal Bipartite Networks via Graph Structure-aware Index
Qiuyang Mang, Jingbang Chen, Hangrui Zhou +6
Bipartite graphs are ubiquitous in many domains, e.g., e-commerce platforms, social networks, and academia, by modeling interactions between distinct entity sets. Within these grap…