activity
20212026
most citedNovel Algorithms for Efficient Mining of Connected Induced Subgraphs of a Given Cardinality

1 citations · 1 across the 5 of their papers we have counts for

collaborators
Showing cs.LGShow all

1 paper · 1 filter

cs.LG2025

Instance-Aware Algorithm Selection for Maximum Clique via a Dual-Channel Graph Neural Architecture

Xiang Li, Shanshan Wang, Chenglong Xiao

Although the Maximum Clique Problem (MCP) has been extensively studied and features a rich ecosystem of exact solvers, empirical evidence shows that solver performance varies subst…