2 papers
cs.DS2024
Fast Biclique Counting on Bipartite Graphs: A Node Pivot-based Approach
Xiaowei Ye, Rong-Hua Li, Longlong Lin +2
Counting the number of -bicliques (complete bipartite subgraphs) in a bipartite graph is a fundamental problem which plays a crucial role in numerous bipartite graph analys…
cs.DS2024
Scalable -clique Densest Subgraph Search
Xiaowei Ye, Miao Qiao, Rong-Hua Li +2
In this paper, we present a collection of novel and scalable algorithms designed to tackle the challenges inherent in the -clique densest subgraph problem (\kcdsp) within networ…