1 citations · 1 across the 6 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
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…
cs.DS2023
Fairness-aware Maximal Biclique Enumeration on Bipartite Graphs
Ziqi Yin, Qi Zhang, Wentao Zhang +2
Maximal biclique enumeration is a fundamental problem in bipartite graph data analysis. Existing biclique enumeration methods mainly focus on non-attributed bipartite graphs and al…