Jieyu Wu — accepted AI-conference papers

2026

A Parallel Framework for the Maximum Common Induced Subgraph Problem

Jieyu Wu, Quan Zhang, Yiyuan Wang, Shiwei Pan, Jian Gao

IJCAI 2026

Finding the maximum common induced subgraph (MCIS) between two graphs is a well-known NP-hard problem. While sequential MCIS algorithms have been extensively studied, parallel computing has emerged as an important direction for further performance enhancement with the advancement of computing resour

Cited by 0 Scholar ↗

2022

NukCP: An Improved Local Search Algorithm for Maximum k-Club Problem

Jiejiang Chen, Yiyuan Wang, Shaowei Cai, Minghao Yin, Yupeng Zhou, Jieyu Wu

AAAI 2022technical

The maximum k-club problem (MkCP) is an important clique relaxation problem with wide applications. Previous MkCP algorithms only work on small-scale instances and are not applicable for large-scale instances. For solving instances with different scales, this paper develops an efficient local search…

Cited by 4 Source ↗PDF ↗code ↗Scholar ↗