6 citations · 10 across the 5 of their papers we have counts for
Showing 2020Show all
3 papers · 1 filter
cs.DB2020★ 1 cited
Efficiently Finding a Maximal Clique Summary via Effective Sampling
Xiaofan Li, Rui Zhou, Lu Chen +3
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and is used in many applications, such as social network analysis, bioinformatics, intelligent agent syste…
cs.DS2020★ 1 cited
Efficient Exact Algorithms for Maximum Balanced Biclique Search in Bipartite Graphs
Lu Chen, Chengfei Liu, Rui Zhou +2
Given a bipartite graph, the maximum balanced biclique (\textsf{MBB}) problem, discovering a mutually connected while equal-sized disjoint sets with the maximum cardinality, plays…
cs.DB2020
Index-based Solutions for Efficient Density Peak Clustering
Zafaryab Rasool, Rui Zhou, Lu Chen +2
Density Peak Clustering (DPC), a popular density-based clustering approach, has received considerable attention from the research community primarily due to its simplicity and fewe…