From the 1 of 1 linked paper with an AI index.
1 paper
Aljaž Krpan, Janez Povh
The paper proposes new reduction rules that incorporate upper‑bound tests to tighten upper bounds for the Maximum Clique Problem, and demonstrates a framework that combines these r…