6 citations · 10 across the 5 of their papers we have counts for
5 papers
Searching Personalized -wing in Large and Dynamic Bipartite Graphs
Aman Abidi, Lu Chen, Rui Zhou +1
There are extensive studies focusing on the application scenario that all the bipartite cohesive subgraphs need to be discovered in a bipartite graph. However, we observe that, for…
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…
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…
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…
Finding Effective Geo-Social Group for Impromptu Activity with Multiple Demands
Lu Chen, Chengfei Liu, Rui Zhou +2
Geo-social group search aims to find a group of people proximate to a location while socially related. One of the driven applications for geo-social group search is organizing an i…