- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource, 1 online resource.
- Language
-
Englisch
- Bibliographic citation
-
Solving larger maximum clique problems using parallel quantum annealing ; volume:22 ; number:5 ; day:16 ; month:5 ; year:2023 ; pages:1-22 ; date:5.2023
Quantum information processing ; 22, Heft 5 (16.5.2023), 1-22, 5.2023
- Creator
-
Pelofske, Elijah
Hahn, Georg
Djidjev, Hristo N.
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s11128-023-03962-x
- URN
-
urn:nbn:de:101:1-2023091910231712077736
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 10:50 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Pelofske, Elijah
- Hahn, Georg
- Djidjev, Hristo N.
- SpringerLink (Online service)
Other Objects (12)
Solving the Maximum Clique Problem via DNA Hairpin Formation
The Maximum Clique Problem for Permutation Hamming Graphs
Implementation of a maximum clique search procedure on CUDA
The maximum clique enumeration problem: algorithms, applications, and implementations
Solving the frequency assignment problem with simulated annealing
Cliquen
Numerical experiments with LP formulations of the maximum clique problem
Computing a maximum clique in geometric superclasses of disk graphs
Solving the medical student scheduling problem using simulated annealing
Benchmarking quantum annealing with maximum cardinality matching problems
RCPred: RNA complex prediction as a constrained maximum weight clique problem
Maximum Shallow Clique Minors in Preferential Attachment Graphs Have Polylogarithmic Size
Solving the Maximum Clique Problem via DNA Hairpin Formation
The Maximum Clique Problem for Permutation Hamming Graphs
Implementation of a maximum clique search procedure on CUDA
The maximum clique enumeration problem: algorithms, applications, and implementations
Solving the frequency assignment problem with simulated annealing
Cliquen
Numerical experiments with LP formulations of the maximum clique problem
Computing a maximum clique in geometric superclasses of disk graphs
Solving the medical student scheduling problem using simulated annealing
Benchmarking quantum annealing with maximum cardinality matching problems
RCPred: RNA complex prediction as a constrained maximum weight clique problem
Maximum Shallow Clique Minors in Preferential Attachment Graphs Have Polylogarithmic Size
Solving the Maximum Clique Problem via DNA Hairpin Formation
The Maximum Clique Problem for Permutation Hamming Graphs
Implementation of a maximum clique search procedure on CUDA
The maximum clique enumeration problem: algorithms, applications, and implementations
Solving the frequency assignment problem with simulated annealing
Cliquen
Numerical experiments with LP formulations of the maximum clique problem
Computing a maximum clique in geometric superclasses of disk graphs
Solving the medical student scheduling problem using simulated annealing
Benchmarking quantum annealing with maximum cardinality matching problems
RCPred: RNA complex prediction as a constrained maximum weight clique problem