J. Povh

works on

core reduction 1 lovász theta 1 maximum clique problem 1 semidefinite programming 1 truss reduction 1 upper bound improvement 1

From the 1 of 4 linked papers with an AI index.

collaborators

Showing math.OCShow all

2 papers · 1 filter

math.OC2025★ 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…

math.OC2025

Quantum and Simulated Annealing-Based Iterative Algorithms for QUBO Relaxations of the Sparsest $k$ -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 $k$ -subgraph (SkS) problem: a quadratic penalty relaxation, a Lagr…

Quantum computing and the stable set problem

Quantum and Simulated Annealing-Based Iterative Algorithms for QUBO Relaxations of the Sparsest k-Subgraph Problem

Quantum and Simulated Annealing-Based Iterative Algorithms for QUBO Relaxations of the Sparsest $k$ -Subgraph Problem