Cheng Long

activity

20232026

k

-Clique Listing: An Edge-Oriented Branching Strategy

2 citations · 2 across the 8 of their papers we have counts for

collaborators

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 $k$ -Plex Search: An Alternated Reduction-and-Bound Method

Shuohao Gao, Kaiqiang Yu, Shengxin Liu +1

$k$ -plexes relax cliques by allowing each vertex to disconnect to at most $k$ vertices. Finding a maximum $k$ -plex in a graph is a fundamental operator in graph mining and has been…

Maximal Clique Enumeration with Hybrid Branching and Early Termination

Maximum k-Plex Search: An Alternated Reduction-and-Bound Method

Maximum $k$ -Plex Search: An Alternated Reduction-and-Bound Method