2 citations · 2 across the 2 of their papers we have counts for
2 papers
math.CO2026
Improving Upper Bounds for the Maximum Clique Problem using Reduction Rules
Aljaž Krpan, Janez Povh
We study the interaction between reduction rules and upper-bound functions for the Maximum Clique Problem (MCP). We show how MCP upper-bound functions can strengthen classical core…
math.OC2024★ 2 cited
Quantum computing and the stable set problem
Aljaž Krpan, Janez Povh, Dunja Pucher
Given an undirected graph, the stable set problem asks to determine the cardinality of the largest subset of pairwise non-adjacent vertices. This value is called the stability numb…