3 papers
cs.LG2026
Learning to Select Maximum Clique Algorithms: From Traditional Machine Learning to a Dual-Channel Hybrid Neural Architecture
Xiang Li, Shanshan Wang, Chenglong Xiao
The Maximum Clique Problem (MCP) is an NP-hard problem with wide-ranging applications in fields such as bioinformatics, network science, and social computing, yet no single algorit…
cs.AR2026
MPM-LLM4DSE: Reaching the Pareto Frontier in HLS with Multimodal Learning and LLM-Driven Exploration
Lei Xu, Shanshan Wang, Chenglong Xiao
High-Level Synthesis (HLS) design space exploration (DSE) seeks Pareto-optimal designs within expansive pragma configuration spaces. To accelerate HLS DSE, graph neural networks (G…
cs.DS2025
An algorithm with a delay of for enumerating connected induced subgraphs of size
Chenglong Xiao, Chengyong Mao, Shanshan Wang
The problem of enumerating connected subgraphs of a given size in a graph has been extensively studied in recent years. In this paper, we propose an algorithm with a delay of $O(kÎ…