Quantum solutions for densest \(k\)-subgraph problems
From MaRDI portal
Publication:1983021
DOI10.1007/s41965-019-00030-1zbMath1469.68060MaRDI QIDQ1983021
Michael J. Dinneen, Cristian S. Calude, Richard Hua
Publication date: 14 September 2021
Published in: Journal of Membrane Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s41965-019-00030-1
quantum annealing; integer programming problems; quadratic unconstrained binary optimization; densest \(k\)-subgraph problem; D-wave 2X
90C35: Programming involving graphs or networks
90C10: Integer programming
68R10: Graph theory (including graph drawing) in computer science
68Q12: Quantum algorithms and complexity in the theory of computing
Uses Software