TSR Desk · science · 12 September 2026, 01:00 UTC
Instance-Aware Algorithm Selection for Maximum Clique via a Dual-Channel Graph Neural
- What
- Instance-Aware Algorithm Selection for Maximum Clique via a Dual-Channel Graph Neural Architecture
- Who
- arxiv.org
- When
- 11 September 2026, 04:00 UTC
- Category
- Science
- Primary source
- https://arxiv.org/abs/2508.08005
- What is not known
- This brief does not claim independent replication. Claims that appear only on X and not in the primary source stay unknown.
We construct a comprehensive benchmark by evaluating four state-of-the-art exact solvers on a diverse collection of graph instances and deriving both global statistical and local structural features. It comes from a paper posted to arXiv on 11 September 2026. 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 substantially across graph families. Consequently, selecting an appropriate algorithm for a given instance remains an open and practically important challenge that has received little systematic attention. We address this gap by developing an instance-aware selection framework that systematically combines global statistical descriptors with learned topological representations. An evaluation of conventional classifiers establishes Random Forest as a strong baseline and reveals that connectivity and topological features are key predictors of performance. Motivated by these observations, we introduce a dual-channel architecture that jointly leverages a Graph Attention Network for capturing local neighborhood patterns and a Multilayer Perceptron for modeling global statistical features. Extensive experiments show that the proposed dual-channel model consistently surpasses classical baselines and the single-best solver, achieving 90.43% test accuracy. These findings demonstrate the value of integrating local topological encoding with global statistical cues for combinatorial algorithm selection. Code and models are available at: https://anonymous.4open.science/r/GAT-MLP-7E5F.
Why it counts
We construct a comprehensive benchmark by evaluating four state-of-the-art exact solvers on a diverse collection of graph instances and deriving both global statistical and local structural features.
Sources
Primary source: primary source
What is not known
This brief does not claim independent replication. Claims that appear only on X and not in the primary source stay unknown.
No clip. The article still stands.