2 citations · 2 across the 6 of their papers we have counts for
4 papers · 1 filter
Fast Maximum Common Subgraph Search: A Redundancy-Reduced Backtracking Approach
Kaiqiang Yu, Kaixin Wang, Cheng Long +2
Given two input graphs, finding the largest subgraph that occurs in both, i.e., finding the maximum common subgraph, is a fundamental operator for evaluating the similarity between…
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…
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…
Reinforcement Learning Enhanced Weighted Sampling for Accurate Subgraph Counting on Fully Dynamic Graph Streams
Kaixin Wang, Cheng Long, Da Yan +2
As the popularity of graph data increases, there is a growing need to count the occurrences of subgraph patterns of interest, for a variety of applications. Many graphs are massive…