2 papers
cs.DS2026
Revisiting Maximum -Biplex Search Through -Bounded-Degree Deletion
Donghang Cui, Ronghua Li, Qiangqiang Dai +1
Biplex, as a relaxation of the biclique model, has emerged as an important cohesive subgraph model for bipartite graph analysis. The maximum -biplex search problem aims to ident…
cs.DS2025
On the Efficient Discovery of Maximum -Defective Biclique
Donghang Cui, Ronghua Li, Qiangqiang Dai +2
The problem of identifying the maximum edge biclique in bipartite graphs has attracted considerable attention in bipartite graph analysis, with numerous real-world applications suc…