7 citations · 18 across the 15 of their papers we have counts for
Showing 2024Show all
2 papers · 1 filter
cs.DB2024
Maximal Clique Enumeration with Hybrid Branching and Early Termination
Kaixin Wang, Kaiqiang Yu, Cheng Long
Maximal clique enumeration (MCE) is crucial for tasks like community detection and biological network analysis. Existing algorithms typically adopt the branch-and-bound framework w…
cs.DB2024
Maximum -Plex Search: An Alternated Reduction-and-Bound Method
Shuohao Gao, Kaiqiang Yu, Shengxin Liu +1
-plexes relax cliques by allowing each vertex to disconnect to at most vertices. Finding a maximum -plex in a graph is a fundamental operator in graph mining and has been…