7 citations · 18 across the 15 of their papers we have counts for
Showing 2023Show all
2 papers · 1 filter
cs.DB2023★ 2 cited
Efficient -Clique Listing: An Edge-Oriented Branching Strategy
Kaixin Wang, Kaiqiang Yu, Cheng Long
-clique listing is a vital graph mining operator with diverse applications in various networks. The state-of-the-art algorithms all adopt a branch-and-bound (BB) framework with…
cs.DB2023
Fast Maximal Quasi-clique Enumeration: A Pruning and Branching Co-Design Approach
Kaiqiang Yu, Cheng Long
Mining cohesive subgraphs from a graph is a fundamental problem in graph data analysis. One notable cohesive structure is -quasi-clique (QC), where each vertex connects at least…