3 papers
cs.DS2026
Maximal Biclique Enumeration with Improved Worst-Case Time Complexity Guarantee: A Partition-Oriented Strategy
Kaixin Wang, Kaiqiang Yu, Cheng Long
The maximal biclique enumeration problem in bipartite graphs is fundamental and has numerous applications in E-commerce and transaction networks. Most existing studies adopt a bran…
cs.DB2025
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…
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…