Quantum computing and the stable set problem

DOI10.1080/10556788.2025.2490639MaRDI QIDQ6907538zbMATH OpenFDO

Authors Aljaž Krpan, Janez Povh, Dunja Pucher

Publication date 1 November 2025

Published in Optimization Methods \& Software (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Quantum computation (81P68)

Cites work

• scientific article; zbMATH DE number 956839 (Why is no real title available?)
• A review on algorithms for maximum clique problems
• An improved bit parallel exact maximum clique algorithm
• An iterative approach to robust and integrated aircraft routing and crew scheduling
• BiqBin: A Parallel Branch-and-bound Solver for Binary Quadratic Problems with Linear Constraints
• BiqBin: moving boundaries for NP-hard problems by HPC
• CLIQUE NUMBERS OF PALEY GRAPHS
• Finding near-optimal independent sets at scale
• Graph partitioning methods for fast parallel quantum molecular dynamics
• Greedy and heuristic algorithms for codes and colorings
• Mathematical foundation of quantum annealing
• Reducibility among combinatorial problems
• Refined estimates concerning sumsets contained in the roots of unity
• Solving larger maximum clique problems using parallel quantum annealing
• The effects of the problem Hamiltonian parameters on the minimum spectral gap in adiabatic quantum optimization

This page was built for publication: Quantum computing and the stable set problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6907538)