From the 1 of 4 linked papers with an AI index.
4 papers
Improving Upper Bounds for the Maximum Clique Problem using Reduction Rules
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…
On solving symmetric multi-type orthogonal non-negative matrix tri-factorization problem
Rok Hribar, Gregor Papa, Janez Povh +1
We study the symmetric multi-type orthogonal non-negative matrix tri-factorization problem, where several symmetric non-negative matrices are simultaneously approximated by factors…
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…
Quantum and Simulated Annealing-Based Iterative Algorithms for QUBO Relaxations of the Sparsest -Subgraph Problem
Omkar Bihani, Roman Kužel, Janez Povh +1
In this paper, we introduce three QUBO (Quadratic Unconstrained Binary Optimization) relaxations for the sparsest -subgraph (SkS) problem: a quadratic penalty relaxation, a Lagr…