Solving larger maximum clique problems using parallel quantum annealing
From MaRDI portal
Publication:6098277
DOI10.1007/s11128-023-03962-xarXiv2205.12165MaRDI QIDQ6098277
Elijah Pelofske, Hristo N. Djidjev, Georg Hahn
Publication date: 13 June 2023
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2205.12165
branch and boundquantum computinggraph decompositionmaximum cliquequantum annealingD-waveparallel quantum annealing
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fast clique minor generation in Chimera qubit connectivity graphs
- An improved fixed-parameter algorithm for vertex cover
- Pseudo-Boolean optimization
- Improved upper bounds for vertex cover
- An exact algorithm for the maximum clique problem
- Solving some NP-complete problems using split decomposition
- Minor-embedding in adiabatic quantum computation. I: The parameter setting problem
- Decomposition by clique separators
- On maximal independent sets of vertices in claw-free graphs
- Geometric algorithms and combinatorial optimization
- On extended \(P_4\)-reducible and extended \(P_4\)-sparse graphs
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
- Exact bounds on the order of the maximum clique of a graph.
- Linear time solvable optimization problems on graphs of bounded clique-width
- Open problems around exact algorithms
- Vertex Cover: Further Observations and Further Improvements
- Fast Algorithms for the Maximum Clique Problem on Massive Sparse Graphs
- Colloquium: Quantum annealing and analog quantum computation
- Parallel Maximum Clique Algorithms with Applications to Network Analysis
- Measure and conquer
- Mathematical foundation of quantum annealing
- Algorithms for maximum independent sets
- On efficient fixed-parameter algorithms for weighted vertex cover
- Algorithm 457: finding all cliques of an undirected graph
This page was built for publication: Solving larger maximum clique problems using parallel quantum annealing
